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-5 of 5 results.

A103953 Smallest perfect power b^e such that b^e+n is also a perfect power, or 0 if no such perfect power exists.

Original entry on oeis.org

8, 25, 1, 4, 4, 0, 1, 1, 16, 2187, 16, 4, 36, 0, 1, 9, 8, 9, 8, 16, 4, 27, 4, 1, 100, 1, 9, 4, 196, 6859, 1, 4, 16, 0, 1, 64, 27, 1331, 25, 9, 8, 0, 441, 81, 4, 243, 81, 1, 32, 0, 49, 144, 676, 27, 9, 8, 64, 0, 841, 4, 64, 0, 1, 36, 16, 0, 1089
Offset: 1

Views

Author

Max Alekseyev, Feb 22 2005

Keywords

Comments

a(A074981(n)) = 0.

Crossrefs

Formula

a(n) = A074954(n)-n, if A074954(n)>0; a(n)=0, if A074954(n)=0.

Extensions

Offset corrected by Mohammed Yaseen, Aug 09 2023

A103954 a(n) is the least k such that k and k+n are adjacent powerful numbers.

Original entry on oeis.org

8, 25, 1, 4, 27, 214369, 9, 64, 16, 2187, 3125, 500, 36, 30459361, 49, 128, 512, 225, 81, 21296, 1331, 100467, 625, 1000, 144, 11881, 169, 972, 36963, 6859, 361, 256, 12967168, 899236854927, 289, 864, 117612, 3087, 10609, 2704, 800, 518436000625
Offset: 1

Views

Author

Max Alekseyev, Feb 22 2005

Keywords

Comments

Sister sequence of a(n)+n is given by A103955.
a(105) > 10^22. - Donovan Johnson, Nov 19 2011

Crossrefs

Extensions

Offset corrected by Donovan Johnson, Nov 19 2011

A189117 Conjectured number of pairs of consecutive perfect powers (A001597) differing by n.

Original entry on oeis.org

1, 1, 2, 3, 1, 0, 2, 1, 3, 1, 2, 1, 3, 0, 2, 1, 5, 2, 3, 1, 1, 0, 1, 2, 1, 2, 1, 3, 0, 1, 0, 1, 1, 0, 2, 1, 1, 1, 3, 1, 1, 0, 1, 0, 1, 0, 3, 1, 2, 0, 1, 0, 2, 0, 2, 1, 1, 0, 1, 2, 1, 0, 1, 0, 3, 0, 2, 2, 1, 0, 2, 0, 2, 1, 1, 1, 1, 0, 3, 1, 1, 0, 1, 0, 1, 0, 1, 0, 3, 0, 0, 1, 1, 1, 2, 0, 2, 0, 1, 5
Offset: 1

Views

Author

T. D. Noe, Apr 16 2011

Keywords

Comments

Only a(1) is proved. Perfect powers examined up to 10^21. This is similar to A076427, but more restrictive.
Hence, through 10^21, there is only one value in the sequence: Semiprimes which are both one more than a perfect power and one less than another perfect power. This is to perfect powers A001597 approximately as A108278 is to squares. A more exact analogy would be to the set of integers such as 30^2 = 900 since 900-1 = 899 = 29 * 31, and 900+1 = 901 = 17 * 53. A189045 INTERSECTION A189047. a(1) = 26 because 26 = 2 * 13 is semiprime, 26-1 = 25 = 5^2, and 26+1 = 27 = 3^3. - Jonathan Vos Post, Apr 16 2011
Pillai's conjecture is that a(n) is finite for all n. - Charles R Greathouse IV, Apr 30 2012

Examples

			1 = 3^2 - 2^3;
2 = 3^3 - 2^5;
3 = 2^2 - 1^2 = 2^7 - 5^3;
4 = 2^3 - 2^2 = 6^2 - 2^5 = 5^3 - 11^2.
		

Crossrefs

Cf. A023056 (least k such that k and k+n are consecutive perfect powers).
Cf. A023057 (conjectured n such that a(n)=0).

Programs

  • Mathematica
    nn = 10^12; pp = Join[{1}, Union[Flatten[Table[n^i, {i, 2, Log[2, nn]}, {n, 2, nn^(1/i)}]]]]; d = Select[Differences[pp], # <= 100 &]; Table[Count[d, n], {n, 100}]

A103955 a(n) is the least k such that k-n and k are adjacent powerful numbers.

Original entry on oeis.org

9, 27, 4, 8, 32, 214375, 16, 72, 25, 2197, 3136, 512, 49, 30459375, 64, 144, 529, 243, 100, 21316, 1352, 100489, 648, 1024, 169, 11907, 196, 1000, 36992, 6889, 392, 288, 12967201, 899236854961, 324, 900, 117649, 3125, 10648, 2744, 841, 518436000667
Offset: 1

Views

Author

Max Alekseyev, Feb 22 2005

Keywords

Comments

Sister sequence of a(n)-n is given by A103954.
a(105) > 10^22. - Donovan Johnson, Nov 19 2011

Crossrefs

Extensions

Offset corrected by Donovan Johnson, Nov 19 2011

A290515 a(n) = smallest number that is the start of a gap of size n between successive prime powers (A000961), or 0 if no such number exists.

Original entry on oeis.org

1, 5, 13, 19, 32, 53, 1024, 89, 512, 139, 536870912, 199, 144115188075855859, 293, 65521, 1831, 8192, 1069, 147573952589676412909, 887, 524288, 1129, 549755813888, 4177, 17179869184, 2477, 16384, 2971, 131072, 1331, 34359738337, 5591, 18014398509481951, 8467, 33554432, 9551
Offset: 1

Views

Author

Robert G. Wilson v, Aug 04 2017

Keywords

Comments

Conjecture: a(n) always exists.
When n is odd a(n) is equal to 2^k or 2^k-n for a suitable k. - Giovanni Resta, Aug 07 2017
Apparently, a(n) = A110968(n-1) - 1 for n >= 3. - Hugo Pfoertner, Jun 17 2024

Examples

			a(1) =  1 since  2 -  1 = 1;
a(2) =  5 since  7 -  5 = 2;
a(3) = 13 since 16 - 13 = 3;
a(4) = 19 since 23 - 19 = 4;
a(5) = 32 since 37 - 32 = 5; etc.
		

Crossrefs

Programs

  • Mathematica
    nxt[n_] := nxt[n] = Block[{k = n + 1}, While[! PrimePowerQ@k, k++]; k]; prv[n_] := prv[n] = Block[{k = n - 1}, While[! PrimePowerQ@k, k--]; k]; f[n_] := Block[{d = 0, exp = 2, p, q}, While[d == 0, p = prv[2^exp]; q = nxt[2^exp]; If[n == 2^exp - p, d = p]; If[n == q - 2^exp, d = 2^exp]; exp++]; d]; Do[ t[n] = f[n], {n, 3, 99, 2}]; p = 1; q = 2; t[_] = 0; While[p < 1110000, d = q - p; If[t[d] == 0, t[d] = p]; p = q; q = nxt@ q]; t@# & /@ Range@ 100

Extensions

a(13)-a(34) from Giovanni Resta, Aug 07 2017
Showing 1-5 of 5 results.