login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)!. 1
1, 4, 23, 238, 4285, 120056, 4807699, 259889218, 18207958073, 1603405689580, 173263178533711, 22534190356771094, 3471514311529290613, 625057269686305463008, 130043797443156653379275 (list; graph; refs; listen; history; internal format)
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.

PROG

(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: A188404 A105747 A099692 * A130890 A138578 A107765

Adjacent sequences:  A123634 A123635 A123636 * A123638 A123639 A123640

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 04 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.