The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076943 Smallest k > 0 such that n*k + 1 is an n-th power. 7

%I #27 Feb 16 2022 23:10:20

%S 1,4,21,20,1555,2604,299593,820,29127,348678440,67546215517,20345052,

%T 61054982558011,281241170407092,76861433640456465,2690420,

%U 128583032925805678351,211927625868,275941052631578947368421,174339220

%N Smallest k > 0 such that n*k + 1 is an n-th power.

%H Marius A. Burtea, <a href="/A076943/b076943.txt">Table of n, a(n) for n = 1..150</a>

%F a(n) <= ((n+1)^n - 1) / n.

%F a(p^k) = ((p+1)^(p^k) - 1) / p^k. - _Charlie Neder_, May 23 2019

%F a(2*p) = ((2*p-1)^(2*p) - 1) / (2*p). - _Charlie Neder_, May 23 2019

%e For n = 7, 1 + 7*a(7) = 1 + 7*299593 = 2097152 = 2^21 = 8^7.

%e For n = 10, 1 + 10*a(10) = 1 + 10*348678440 = 3486784401 = 3^20 = 9^10. - _Marius A. Burtea_, Jun 01 2019

%t Do[k = 2; While[ !IntegerQ[(k^n - 1)/n], k++ ]; Print[(k^n - 1)/n], {n, 1, 20}] (* _Robert G. Wilson v_, Oct 21 2002 *)

%o (Magma) sol:=[];

%o for u in [1..20] do

%o for k in [2..100] do

%o if IsIntegral((k^u-1)/u) then sol[u]:=(k^u-1)/u; break; end if;

%o end for;

%o end for;

%o sol; // _Marius A. Burtea_, Jun 01 2019

%Y Cf. A076942, A076944, A074792.

%K nice,nonn

%O 1,2

%A _Amarnath Murthy_, Oct 19 2002

%E Edited, corrected and extended by _Robert G. Wilson v_, Oct 21 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 9 14:04 EDT 2024. Contains 373243 sequences. (Running on oeis4.)