id:A096309 - OEIS Search Results

Search: id:A096309

Displaying 1-1 of 1 results found.

page 1

a(1)=1; for n>1, a(n) is the number of levels in the "stacked" prime number factorization of n (prime number factorization of the exponents if necessary and so on ...).

+0
1

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

	OFFSET	`1,4`
	COMMENT	`For n>1: a(n)=1 iff n squarefree`
	EXAMPLE	`a(4)=2 because 4=2^2; a(8)=2 because 8=2^3; a(16)=3 because 16=2^(2^2);`
	CROSSREFS	`Cf. A087049.` `Sequence in context: A007424 A085424 A088737 this_sequence A049419 A046951 A159631` `Adjacent sequences: A096306 A096307 A096308 this_sequence A096310 A096311 A096312`
	KEYWORD	`easy,nonn`
	AUTHOR	`Franz Vrabec (franz.vrabec(AT)aon.at), Jun 27 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research