|
Search: id:A062970
|
|
|
| A062970 |
|
a(n) = 1 + sum_{j=1..n} j^j. |
|
+0
6
|
|
| 1, 2, 6, 33, 289, 3414, 50070, 873613, 17650829, 405071318, 10405071318, 295716741929, 9211817190185, 312086923782438, 11424093749340454, 449317984130199829, 18896062057839751445, 846136323944176515622
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
The usual convention in the OEIS is that 0^0 = 1. This sequence could therefore be defined as Sum_{j=0..n} j^j. See also A001923.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..100
|
|
FORMULA
|
a(n) = a(n-1)+A000312(n) = A001923(n)+1.
|
|
EXAMPLE
|
a(4) = 1+1^1+2^2+3^3+4^4 = 1+1+4+27+256 = 289.
|
|
MATHEMATICA
|
Table[Sum[Sum[Binomial[n, k] StirlingS2[n, k] k!, {k, 0, n}], {n, 0, m}], {m, 0, 20}] [From Geoffrey Critzer (critzer.geoffrey(AT)usd443.org), Mar 18 2009]
|
|
PROGRAM
|
(PARI) { a=0; for (n=0, 100, write("b062970.txt", n, " ", a+=n^n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 14 2009]
|
|
CROSSREFS
|
Sequence in context: A053042 A012874 A005161 this_sequence A088125 A064940 A105142
Adjacent sequences: A062967 A062968 A062969 this_sequence A062971 A062972 A062973
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jul 23 2001
|
|
|
Search completed in 0.002 seconds
|
