id:A090620 - OEIS Search Results

Search: id:A090620

Displaying 1-1 of 1 results found.

page 1

Highest power of 13 dividing n!.

+0
5

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

	OFFSET	`0,27`
	FORMULA	`a(n) =A090622(n, 13) =A090623(n, 13) =[n/13]+[n/169]+[n/2197]+...`
	CROSSREFS	`Cf. A011371, A054861.` `Sequence in context: A137325 A000195 A135663 this_sequence A057467 A074594 A001069` `Adjacent sequences: A090617 A090618 A090619 this_sequence A090621 A090622 A090623`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Dec 06 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research