Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115871
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115871 Table listing for each n (in descending order) all m's <= n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i. +0
6
1, 2, 3, 4, 5, 6, 7, 3, 8, 9, 10, 11, 7, 12, 13, 5, 14, 6, 15, 16, 17, 18, 19, 15, 20, 21, 13, 22, 14, 23, 19, 15, 24, 25, 9, 26, 10, 27, 15, 28, 12, 29, 21, 13, 30, 31, 27, 11, 32, 33, 34, 35, 31, 36, 37, 29, 38, 30, 39, 35, 40, 41, 25, 42, 26, 43, 27, 44, 28, 45, 46, 38, 30, 47, 27 (list; graph; listen)
OFFSET

1,2

COMMENT

Here * stands for ordinary multiplication and X means carryless (GF(2)[X]) multiplication (A048720).

LINKS

Index entries for sequences defined by congruent products between domains N and GF(2)[X]

EXAMPLE

Row n has A115861(n)+1 elements: 1; 2; 3; 4; 5; 6; 7,3; 8; 9; 10; 11,7; 12; 13,5; 14,6; 15; etc.

CROSSREFS

Cf. A115857, A115859, A115861, A115869, A115872.

Sequence in context: A104415 A071074 A066323 this_sequence A138221 A038388 A083501

Adjacent sequences: A115868 A115869 A115870 this_sequence A115872 A115873 A115874

KEYWORD

nonn,tabf

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Feb 07 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.


AT&T Labs Research