Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073848 Smallest of n consecutive numbers in A.P. with a common difference of n with a sum that is an n-th power. +0
1
1, 1, 6, 58, 615, 7761, 117628, 4, 2151, 999999955, 25937424546, 181398462, 23298085122403, 793714773254053, 29192926025390520, 3976, 48661191875666868345, 5642219814759, 104127350297911241532670 (list; graph; listen)
OFFSET

1,3

FORMULA

For n!=4: a(n)=(p_1*p_2*...p_r)^n/n-n*(n-1)/2 with prime factorization n=p_1^b_1*...*p_r^b_r.

Proof of formula: If a is the first member in A.P. then there must exist an integer m with n*a+n*n*(n-1)/2=m^n. Therefore all prime divisors of n divide m. For n>4 this gives a positive solution for a.

EXAMPLE

a(4) = 58 and 58 +62 +66 +70 = 256 = 4^4.

MAPLE

for n from 1 to 50 do a := ifactors(n); b := 1:for j from 1 to nops(a[2]) do b := b*a[2][j][1]; od; c[n] := b^n/n-n*(n-1)/2; od:c[4] := 58:seq(c[j], j=1..50);

CROSSREFS

Sequence in context: A034218 A034237 A004301 this_sequence A141382 A034982 A156147

Adjacent sequences: A073845 A073846 A073847 this_sequence A073849 A073850 A073851

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 14 2002

EXTENSIONS

Formula and more terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 14 2002

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research