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!)
A090962 Least multiple of n such that the n-th partial sum is an n-th power with the condition that a(n+1) exists. 1

%I #11 Nov 19 2017 12:55:14

%S 1,8,207,40,7520,38880,2050496,14680064,983222784,9000000000,

%T 733008370688,8173092077568,784798672805888,10318292052303872,

%U 1141809497781288960,1025031833202524160,2183733606400887160832

%N Least multiple of n such that the n-th partial sum is an n-th power with the condition that a(n+1) exists.

%e a(2) = 8, yielding the 2nd partial sum 1 + 8 = 9 = 3^2.

%e a(3) cannot be j^3 - 9 for j = 3, 4, or 5, because there would be no number k such that j^3 + 4k = is a 4th power; thus, a(3) = 207, yielding the 3rd partial sum 9 + 207 = 216 = 6^3 (and a(4) = 4^4 - 6^3 = 40).

%Y Cf. A090963.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Jan 02 2004

%E More terms from _David Wasserman_, Feb 23 2006

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 August 7 16:02 EDT 2024. Contains 375017 sequences. (Running on oeis4.)