cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A194699 a(n) = floor((p - 1)/12) - floor((p^2 - 1)/(24*p)), where p = prime(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16
Offset: 1

Views

Author

Omar E. Pol, Jan 18 2012

Keywords

Comments

Sequence related to Ramanujan's famous partition congruences modulo powers of 5, 7 and 11. Ramanujan wrote: "It appears there are no equally simple properties for any moduli involving primes other than these three". On the other hand the Folsom-Kent-Ono theorem said: for a prime L >= 5, the partition numbers are L-adically fractal. Moreover, the Hausdorff dimension is <= floor((L - 1)/12) - floor((L^2 - 1)/(24*L)). Also, the Folsom-Kent-Ono corollary said: the dim is 0 only for L = 5, 7, 11 and so we have: 1) Ramanujan's congruences powers of 5, 7 and 11. 2) There are no simple properties for any other primes.

Examples

			For primes 5, 7, 11 the Hausdorff dimension = 0, so a(3)..a(5) = 0.
For primes 13, 17, 19, 23, 29, 31 the Hausdorff dimension = 1, so a(6)..a(11) = 1.
		

Crossrefs

Formula

a(n) = A194698(A000040(n)).
a(n) ~ 0.125 n log n. [Charles R Greathouse IV, Jan 25 2012]