Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036452
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036452 a(n)=d[ d[ d[ d[ n ] ] ] ], the 4th iterate of number-of-divisors function with initial value of n. +0
7
1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; listen)
OFFSET

1,2

COMMENT

The iterated d function rapidly converges to fixed point 2. For k=4 the first n for which a(n)>2 is 60.

FORMULA

a[ n ]=Nest[ d, n, 4 ]

EXAMPLE

E.g. n=96 and its successive iterates are 12,6,4,3 and 2. The 4th term is a(96)=3.

CROSSREFS

A000005, A015553, A036450, A036453.

Sequence in context: A007395 A055642 A138902 this_sequence A102572 A098391 A071702

Adjacent sequences: A036449 A036450 A036451 this_sequence A036453 A036454 A036455

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research