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.

A138363 Number of prime powers p^e with e>1 and 0

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 16 2008

Keywords

Comments

a(A049084(A074267(n))) > 0;
a(31)=2, what is the next value greater than 1?.

Examples

			A000040(10)=29: a(10) = #{4+5^2, 2+3^3} = 2.
		

Programs

  • Mathematica
     f[n_] := Block[{c = 0, j, k = 1, p = Prime@ n, q}, j = 1 + PrimePi@ Sqrt@ p; While[k < j, q = Prime@ k; If[p < q + q^Floor@ Log[q, p], c++ ]; k++ ]; c]; Array[f, 105]