login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096309 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, 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; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

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 * A049419 A046951 A159631

Adjacent sequences:  A096306 A096307 A096308 * A096310 A096311 A096312

KEYWORD

easy,nonn

AUTHOR

Franz Vrabec (franz.vrabec(AT)aon.at), Jun 27 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.