login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093844 n-th row of the following triangle contains n terms of an arithmetic progression with the first term 1 such that the sum is the least possible n-th power. Sequence contains the leading diagonal. 2
1, 3, 17, 7, 1249, 15551, 235297, 419903, 86093441, 1999999999, 51874849201, 1486016741375, 46596170244961, 1587429546508287, 58385852050781249, 8191, 97322383751333736961, 4371823119477393063935, 208254700595822483065681 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

1

1 3

1 9 17

1 3 5 7

1 313 625 937 1249

1 3111 6221 9331 12441 15551

LINKS

Table of n, a(n) for n=1..19.

PROG

(PARI) {a(n)=local(k); k=2; while(2*Mod(k, n)^n!=0||2*(Mod(k, n-1)^n-1)!=0, k++); 2*k^n/n-1} (Alekseyev)

CROSSREFS

Cf. A093460, A093845.

Cf. A093845, A110500.

Sequence in context: A195421 A140446 A124689 * A273211 A273273 A273249

Adjacent sequences: A093841 A093842 A093843 * A093845 A093846 A093847

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Apr 18 2004

EXTENSIONS

More terms from Max Alekseyev, Jul 23 2005

STATUS

approved

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 November 28 10:02 EST 2022. Contains 358411 sequences. (Running on oeis4.)