Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123637 a(n) = 1 + 1*n + 1*n*2 + 1*n*2*(n-1) + 1*n*2*(n-1)*3 + 1*n*2*(n-1)*3*(n-2) + ... + n!*(n+1)!. +0
2
1, 4, 23, 238, 4285, 120056, 4807699, 259889218, 18207958073, 1603405689580, 173263178533711, 22534190356771094, 3471514311529290613, 625057269686305463008, 130043797443156653379275 (list; graph; listen)
OFFSET

0,2

EXAMPLE

a(n) equals the sum of (2n+1) terms:

a(0) = 1;

a(1) = 1 + 1*1 + 1*1*2 = 4;

a(2) = 1 + 1*2 + 1*2*2 + 1*2*2*1 + 1*2*2*1*3 = 23;

a(3) = 1 + 1*3 + 1*3*2 + 1*3*2*2 + 1*3*2*2*3 + 1*3*2*2*3*1 + 1*3*2*2*3*1*4 = 238.

PROGRAM

(PARI) {a(n)=sum(k=1, 2*n+1, prod(j=1, k, ((j+1)\2)*(j%2)+(n+1-(j\2))*((j-1)%2)))}

CROSSREFS

Cf. A123636.

Sequence in context: A056785 A105747 A099692 this_sequence A130890 A138578 A107765

Adjacent sequences: A123634 A123635 A123636 this_sequence A123638 A123639 A123640

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 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 December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research