The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #17 Nov 26 2024 12:02:17
%S 7,8,11,5,32,17,44,3,88,27,13,87,169,113,104,271,24,272,35,397,320,
%T 139,10,204,343,381,250,721,817,919,729,298,917,224,192,1069,739,648,
%U 1519,1657,817,984,759,423,769,2107,1053,1216,2437,2611,1561,1230,2977,3169,2479,888
%N First differences of consecutive perfect powers m^k with k>=3 (A076467).
%H Hugo Pfoertner, <a href="/A377933/b377933.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/plot2a?name1=A000027&name2=A377933&tform1=log+base+10&tform2=log+base+10&shift=0&radiop1=xy&drawpoints=true">Plot of log_10(a(n)) vs log_10(n)</a>, using Plot 2.
%F a(n) = A076467(n+1) - A076467(n).
%p N:= 10^5: # for terms <= N of A076467
%p S:= sort(convert({1, seq(seq(m^k, m = 2 .. floor(N^(1/k))), k=3..ilog2(N))},list)):
%p S[2..-1]-S[1..-2]; # _Robert Israel_, Nov 24 2024
%o (PARI) lista(nn) = my(S=List(1)); for(x=2, sqrtnint(nn, 3), for(k=3, logint(nn, x), listput(S, x^k))); my(v=Set(S)); vector(#v-1, k, v[k+1]-v[k]); \\ _Michel Marcus_, Nov 24 2024
%Y Cf. A001597, A053289, A076467.
%K nonn,easy
%O 1,1
%A _Hugo Pfoertner_, Nov 24 2024