id:A132292 - OEIS Search Results

Search: id:A132292

Displaying 1-1 of 1 results found.

page 1

Floor((n^8-1)/(8*n^7)), which is the same as integers repeated 8 times.

+0
1

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9 (list; graph; listen)

	OFFSET	`1,17`
	FORMULA	`Also, floor[(n^8-n^7)/(8n^7-7n^6)] - Mohammad K. Azarian (azarian(AT)evansville.edu), Nov 18 2007` `a(n)=-1+Sum{k=0..n}{1/224(-27(k mod 8)+((k+1) mod 8)+((k+2) mod 8)+((k+3) mod 8)+((k+4) mod 8)+((k+5) mod 8)+((k+6) mod 8)+29*((k+7) mod 8))} - Paolo P. Lava (ppl(AT)spl.at), Nov 27 2007`
	CROSSREFS	`Cf. A004526; A002264; A002265; A002266; A054895.` `Sequence in context: A135664 A058318 A133878 this_sequence A110656 A104407 A054897` `Adjacent sequences: A132289 A132290 A132291 this_sequence A132293 A132294 A132295`
	KEYWORD	`nonn`
	AUTHOR	`Mohammad K. Azarian (azarian(AT)evansville.edu), Nov 06 2007`
	EXTENSIONS	`Corrected the first offset. - Mohammad K. Azarian (azarian(AT)evansville.edu), Nov 20 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research