Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129357
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129357 G.f.: A(x) = Product_{n>=1} [ (1-x)^4*(1 + 4x + 10x^2 +...+ n(n+1)(n+2)/3!*x^(n-1)) ]. +0
5
1, -4, -4, 36, -64, 256, -1328, 4488, -11406, 17700, 14716, -194508, 662768, -1374476, 2210780, -5820284, 25965483, -95963664, 259794360, -545959440, 952758316, -1278120568, 60070208, 8030404744, -34554134770, 94549651780, -196087124052, 330754522268, -511020392180 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: A(x) = Product_{n>=1} [ 1 - (n+1)(n+2)(n+3)/3!*x^n + 3n(n+2)(n+3)/3!*x^(n+1) - 3n(n+1)(n+3)/3!*x^(n+2) + n(n+1)(n+2)/3!*x^(n+3) ].

EXAMPLE

G.f.: A(x) = (1-4x+6x^2-4x^3+x^4)*(1-10x^2+20x^3-15x^4+4x^5)*(1-20x^3+45x^4-36x^5+10x^6)*(1-35x^4+84x^5-70x^6+20x^7)*...

Terms are divisible by 4 except at positions given by:

a(n) == 1 (mod 4) at n = 16*[0, 2, 5, 15, 22, 26, 40,...];

a(n) == -1 (mod 4) at n = 16*[1, 7, 12, 35, 51, 57,...];

a(n) == 2 (mod 4) at n = 8*[1,3,5,6,8,9,13,15,16,19,..,A129359(k),..].

PROGRAM

(PARI) {a(n)=if(n==0, 1, polcoeff(prod(k=1, n, (1-x)^4*sum(j=1, k, binomial(j+2, 3)*x^(j-1)) +x*O(x^n)), n))}

CROSSREFS

Cf. A129355, A129356, A129358, A129359.

Sequence in context: A089542 A105350 A126936 this_sequence A100303 A111882 A070959

Adjacent sequences: A129354 A129355 A129356 this_sequence A129358 A129359 A129360

KEYWORD

sign

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Apr 11 2007

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research