The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129359 Positions k, divided by 8, where A129357(k) is congruent to 2 modulo 4; A129357(8*a(n)) == 2 (mod 4) for n>=0. 1
 1, 3, 5, 6, 8, 9, 13, 15, 16, 19, 20, 23, 26, 27, 28, 29, 31, 33, 34, 35, 36, 38, 45, 48, 50, 51, 53, 55, 56, 59, 61, 63, 64, 69, 71, 73, 77, 78, 83, 84, 85, 86, 89, 91, 93, 94, 96, 100, 101, 103, 104, 108, 110, 115, 119, 121, 124, 127 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS G.f. for A129357 is Product_{n>=1} [ (1-x)^4*(1 + 4x + 10x^2 +...+ n(n+1)(n+2)/3!*x^(n-1)) ]. LINKS CROSSREFS Cf. A129357. Sequence in context: A164902 A278996 A099441 * A110801 A078339 A174805 Adjacent sequences:  A129356 A129357 A129358 * A129360 A129361 A129362 KEYWORD more,nonn AUTHOR Paul D. Hanna, Apr 11 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 18:22 EST 2020. Contains 338910 sequences. (Running on oeis4.)