The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A120490 1 + Sum[ k^(n-1), {k,1,n}]. 0
 2, 4, 15, 101, 980, 12202, 184821, 3297457, 67731334, 1574304986, 40851766527, 1170684360925, 36720042483592, 1251308658130546, 46034015337733481, 1818399978159990977, 76762718946972480010, 3448810852242967123282 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Prime p divides a(p). Prime p divides a(p-2) for p>3. p^2 divides a(p-2) for prime p=7. p^2 divides a(p^2-2) for prime p except p=3. p^3 divides a(p^2-2) for prime p=7. p^3 divides a(p^3-2) for prime p>3. p^4 divides a(p^3-2) for prime p=7. p^4 divides a(p^4-2) for prime p>3. p^5 divides a(p^3-2) for prime p=7. It appears that p^k divides a(p^k-2) for prime p>3 and 7^(k+1) divides a(7^k-2) for integer k>0. LINKS FORMULA a(n) = 1 + Sum[ k^(n-1), {k,1,n}]. a(n) = 1 + A076015[n]. MATHEMATICA Table[(1+Sum[k^(n-1), {k, 1, n}]), {n, 1, 23}] CROSSREFS Cf. A076015. Sequence in context: A020134 A307085 A228934 * A003514 A065598 A264832 Adjacent sequences:  A120487 A120488 A120489 * A120491 A120492 A120493 KEYWORD nonn AUTHOR Alexander Adamchuk, Aug 04 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 24 19:27 EST 2020. Contains 332209 sequences. (Running on oeis4.)