Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124405
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124405 Sum[ i^j, {i,1,n}, {j,1,n} ] + 1. +0
4
2, 9, 57, 495, 5700, 82201, 1419761, 28501117, 651233662, 16676686697, 472883843993, 14705395791307, 497538872883728, 18193397941038737, 714950006521386977, 30046260016074301945, 1344648068888240941018 (list; graph; listen)
OFFSET

1,1

COMMENT

p divides a(p) and a(p-1) for prime p. p^2 divides a(p) for prime p = {5, 13, 563, ...} which coincide with known Wilson primes A007540(n) = {5, 13, 563, ...} primes p such that (p-1)! == -1 mod p^2. p^2 divides a(p-1) for prime p = {3, 11, 107, ...} which coincides with the first few known odd primes p such that (p-2)! == 1 mod p^2 and belong to A079853(n) = {2, 3, 11, 107, 4931, ...}.

FORMULA

a(n) = Sum[ i^j, {i,1,n}, {j,1,n} ] + 1. a(n) = Sum[ i*(i^n-1)/(i-1), {i,2,n} ] + n + 1. a(n) = A086787(n) + 1.

MATHEMATICA

Table[Sum[i^j, {i, 1, n}, {j, 1, n}]+1, {n, 1, 20}]

CROSSREFS

Cf. A086787 = Sum(Sum(i^j, j=1..n), i=1..n). Cf. A079853 = Primes p for which (p-2)! == 1 mod p^2. Cf. A007540 = Wilson primes: primes p such that (p-1)! == -1 mod p^2.

Sequence in context: A004103 A111545 A070075 this_sequence A141787 A047852 A116867

Adjacent sequences: A124402 A124403 A124404 this_sequence A124406 A124407 A124408

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Dec 14 2006

page 1

Search completed in 0.004 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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research