A200811 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A200811

Iterate k -> d(k) until an odd prime is reached, starting from the n-th composite.

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: A053388 A372511 A091786 * A339055 A331134 A303168

Adjacent sequences: A200808 A200809 A200810 * A200812 A200813 A200814

KEYWORD

nonn

AUTHOR

Charles R Greathouse IV, Nov 23 2011

STATUS

approved