login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220515 Numbers n such that A183054(n) is not equal to A188569(n). 2

%I #26 Mar 20 2013 12:28:47

%S 24,47,49,74,96,99,116,124,145,149,162,174,194,199,224,237,243,249,

%T 274,277,292,299,324,331,341,346,349,358,374,390,399,424,439,449,474,

%U 479,488,499,500,507,524,537,549,566,574,586,599,600,624,635

%N Numbers n such that A183054(n) is not equal to A188569(n).

%C For an algorithm to compute the partition class polynomial Hpart_n(x) see the Bruinier-Ono-Sutherland paper, 3.3. Algorithm 3, p. 15-19. For more information see A222031.

%H J. H. Bruinier, K. Ono, A. V. Sutherland, <a href="http://arxiv.org/abs/1301.5672">Class polynomials for nonholomorphic modular functions</a>

%H A. V. Sutherland, <a href="http://math.mit.edu/~drew/Pfiles/">Partition class polynomials</a>, Hpart_n(x), for n = 1..770

%e First three terms are 24, 47, 49 because first 50 terms of A183054 coincide with first 50 terms of A188569 except for the indices 24, 47, 49 as shown below:

%e (A183054(24) = 3) < (A188569(24) = 21).

%e (A183054(47) = 3) < (A188569(47) = 27).

%e (A183054(49) = 5) < (A188569(49) = 35).

%e Observation:

%e A183054(24) = A188569(24)/7 = 3.

%e A183054(47) = A188569(47)/9 = 3.

%e A183054(49) = A188569(49)/7 = 5.

%Y Cf. A000041, A183010, A183011, A183054, A188569, A222031, A222032.

%K nonn

%O 1,1

%A _Omar E. Pol_, Feb 27 2013

%E a(4)-a(50) from _Giovanni Resta_, Mar 04 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 3 19:32 EDT 2024. Contains 375674 sequences. (Running on oeis4.)