Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135203
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135203 For any integer n>1 the sequence gives the minimum power x for which n^x+(n-1)^x+(n-2)^x+...+1^x produces a perfect square. +0
1
1, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)
OFFSET

0,2

COMMENT

All 3 apart from 1 in position given by A001108 and 2 for n=24.

EXAMPLE

n=4 -> 4^3+3^3+2^3+1^3 = 64+27+8+1 = 100

n=5 -> 5^3+4^3+3^3+2^3+1^3 = 125+64+27+8+1 = 225

n=6 -> 6^3+5^3+4^3+3^3+2^3+1^3 = 216+125+64+27+8+1 = 441

MAPLE

P:=proc(n) local a, i, k, j, ok, x; for i from 1 by 1 to n do x:=1; ok:=1; while ok=1 do a:=0; k:=i; while k>0 do a:=a+k^x; k:=k-1; od; if (trunc(sqrt(a)))^2=a then print(x); ok:=0; else x:=x+1; fi; od; od; end: P(100);

CROSSREFS

Cf. A001108.

Sequence in context: A141605 A073139 A122845 this_sequence A102818 A010701 A122553

Adjacent sequences: A135200 A135201 A135202 this_sequence A135204 A135205 A135206

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Nov 28 2007

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research