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.

A246067 Record values in A246066.

Original entry on oeis.org

4, 8, 16, 25, 27, 32, 49, 64, 81, 121, 125, 128, 169, 243, 256, 289, 343, 361, 512, 625, 729, 841, 961, 1024, 1331, 1369, 1681, 1849, 2048, 2187, 2401, 2809, 3125, 3481, 3721, 4096, 4489, 4913, 5041, 5329, 6241, 6561, 6859, 7921, 8192, 9409, 10201, 10609, 11449
Offset: 1

Views

Author

Arkadiusz Wesolowski, Aug 23 2014

Keywords

Comments

Subsequence of A025475. The missing terms of A025475 are 1 and prime powers q^n for which there is a smaller prime power p^m with q^n-q <= p^m-p, i.e., q^n = p^m+d for some d <= q-p. The first cases: 9 = 3^2 = 2^3+1, 529 = 23^2 = 2^9+17, 2197 = 13^3 = 3^7+10, 2209 = 47^2 = 3^7+22, 6889 = 83^2 = 19^3+30. - Jens Kruse Andersen, Aug 26 2014

Crossrefs

Programs

  • PARI
    k=2; for(n=0, 10506, k=k-1; r=k+1; until(vecmax(vector(#f[, 1], i, f[i, 1]^f[i, 2]))>vecmax(f[, 1])+n, k++; f=factor(k)); if(k>r, print1(k, ", ")));