Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115861
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115861 Number of distinct m's < n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i. +0
5
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 1, 1, 2, 0, 2, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 2, 2, 0, 1, 1, 0, 1, 1, 1, 4, 1, 1, 2, 3, 0, 3, 2, 3, 0, 0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 2, 1, 2, 1, 3, 0, 1, 1, 2, 1, 1, 1, 2, 1, 2, 0, 4, 2, 2, 2, 2, 0, 1, 1, 4, 1, 2, 0 (list; graph; listen)
OFFSET

1,23

LINKS

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

CROSSREFS

a(2n) = a(n). Cf. A115859, A115869, A115871.

Adjacent sequences: A115858 A115859 A115860 this_sequence A115862 A115863 A115864

Sequence in context: A025914 A025916 A025905 this_sequence A005087 A050332 A029425

KEYWORD

nonn

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research