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.

Showing 1-2 of 2 results.

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]

A136335 Indices of the primes p for which the number of representations of p as the sum of a perfect prime power (A025475: q^e with e>1) and an integer k which is less than q exceeds one.

Original entry on oeis.org

10, 31, 14774, 14775, 65686, 110128, 110129, 110130, 110131, 110132, 110133, 110134, 110135, 110136, 110137, 165952, 165953, 165954, 165955, 165956, 165957, 165958, 304841, 304842, 304843, 304844, 304845, 304846, 304847
Offset: 1

Views

Author

Keywords

Comments

Where A138363 exceeds 1.

Examples

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

Crossrefs

Programs

  • Mathematica
    f[n_] := Block[{c = 0, e, 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]; lst = {}; Do[ If[f@n > 1, AppendTo[lst, n]; Print[Prime@n]], {n, 25*10^5}]
Showing 1-2 of 2 results.