id:A063775 - OEIS Search Results

Search: id:A063775

Displaying 1-1 of 1 results found.

page 1

Number of 4th powers dividing n.

+0
1

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,16`
	FORMULA	`a(n) = A000005(A053164(n)) = A046951(A000188(n)). Multiplicative with a(p^k) = 1+[k/4].`
	EXAMPLE	`a(79) = 1 since 79 is divisible by 1 = 1^4; a(80) = 2 since 80 is divisible by 1 and 16 = 2^4; a(81) = 2 since 81 is divisible by 1 and 81 = 3^4.`
	CROSSREFS	`Cf. A046951, A061704.` `Sequence in context: A058665 A043290 A043289 this_sequence A053164 A055229 A062379` `Adjacent sequences: A063772 A063773 A063774 this_sequence A063776 A063777 A063778`
	KEYWORD	`mult,easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Aug 16 2001`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research