|
Search: id:A061711
|
|
| |
|
| 1, 8, 162, 6144, 375000, 33592320, 4150656720, 676457349120, 140587147048320, 36288000000000000, 11388728893445164800, 4270826380475341209600, 1886009588552176549862400, 968725766854884321342259200
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) = product of first n terms of an arithmetic progression with first term n and common difference n. E.g. a(3) = 3*6*9 = 162. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 20 2003
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,100
|
|
EXAMPLE
|
a(1)=1!*1^1=1, a(2)=2!*2^2=8, a(3)=3!*3^3=162.
|
|
MAPLE
|
with (combinat):seq(mul(sum(binomial(k+1, k), j=0..n), k=0..n), n=0..13); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 02 2007
seq(mul(j*n, j=1..n), n=1..14); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 02 2007
a:=n->mul(sum(k, j=1..n), k=1..n): seq(a(n), n=1..14); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 02 2007
|
|
MATHEMATICA
|
lst={}; Do[AppendTo[lst, Floor[n!*n^n]], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jan 15 2009]
|
|
PROGRAM
|
(PARI) { for (n=1, 100, write("b061711.txt", n, " ", n!*n^n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 26 2009]
|
|
CROSSREFS
|
Cf. A053042, A036679, A055775 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jan 15 2009]
Sequence in context: A140337 A065116 A061250 this_sequence A075387 A143857 A025606
Adjacent sequences: A061708 A061709 A061710 this_sequence A061712 A061713 A061714
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Lorenzo Fortunato (fortunat(AT)pd.infn.it), Jun 19 2001
|
|
|
Search completed in 0.002 seconds
|
