Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120490 1 + Sum[ k^(n-1), {k,1,n}]. +0
1
2, 4, 15, 101, 980, 12202, 184821, 3297457, 67731334, 1574304986, 40851766527, 1170684360925, 36720042483592, 1251308658130546, 46034015337733481, 1818399978159990977, 76762718946972480010, 3448810852242967123282 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

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.

Adjacent sequences: A120487 A120488 A120489 this_sequence A120491 A120492 A120493

Sequence in context: A020110 A140836 A020134 this_sequence A003514 A065598 A100528

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 04 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research