Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090962
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090962 Least multiple of n so that the n-th partial sum is an n-th power with the condition that a(n+1) exists. +0
2
1, 8, 207, 40, 7520, 38880, 2050496, 14680064, 983222784, 9000000000, 733008370688, 8173092077568, 784798672805888, 10318292052303872, 1141809497781288960, 1025031833202524160, 2183733606400887160832 (list; graph; listen)
OFFSET

1,2

COMMENT

a(3) = 207 and is not 18 so that a(4)=40 exists. and 1+8+207 +40 = 4^4.

CROSSREFS

Cf. A090963.

Sequence in context: A020329 A034861 A063856 this_sequence A024288 A081794 A048433

Adjacent sequences: A090959 A090960 A090961 this_sequence A090963 A090964 A090965

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 02 2004

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 23 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research