login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200811 Iterate k -> d(k) until an odd prime is reached, starting from the n-th composite. 2
3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) is not 3 for n in {9, 45, 58, 89, 128, 163, 168, ...}.

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Tímea Csajbók and János Kasza, Iterating the tau-function, Annales Univ. Sci. Budapest., Sec. Math. 35 (2011), pp. 83-93.

CROSSREFS

Cf. A200810, A200815.

Sequence in context: A032568 A053388 A091786 * A339055 A331134 A303168

Adjacent sequences:  A200808 A200809 A200810 * A200812 A200813 A200814

KEYWORD

nonn

AUTHOR

Charles R Greathouse IV, Nov 23 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 28 06:43 EST 2022. Contains 350654 sequences. (Running on oeis4.)