login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115861 Number of distinct m's < n, such that there exists nonzero solutions to a cross-domain congruence m*i = n X i. 4
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; refs; listen; history; text; internal format)
OFFSET

1,23

LINKS

Table of n, a(n) for n=1..102.

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

CROSSREFS

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

Sequence in context: A333809 A306440 A025905 * A282355 A199322 A284203

Adjacent sequences:  A115858 A115859 A115860 * A115862 A115863 A115864

KEYWORD

nonn

AUTHOR

Antti Karttunen, Feb 07 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 15:24 EST 2021. Contains 349581 sequences. (Running on oeis4.)