id:A129359 - OEIS Search Results

Search: id:A129359

Displaying 1-1 of 1 results found.

page 1

Positions k, divided by 8, where A129357(k) is congruent to 2 modulo 4; A129357(8*a(n)) == 2 (mod 4) for n>=0.

+0
2

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; listen)

	OFFSET	`0,2`
	COMMENT	`G.f. for A129357 is Product_{n>=1} [ (1-x)^4(1 + 4x + 10x^2 +...+ n(n+1)(n+2)/3!x^(n-1)) ].`
	PROGRAM	`(PARI)`
	CROSSREFS	`Cf. A129357.` `Sequence in context: A047446 A058065 A099441 this_sequence A110801 A078339 A047220` `Adjacent sequences: A129356 A129357 A129358 this_sequence A129360 A129361 A129362`
	KEYWORD	`easy,more,nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Apr 11 2007`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research