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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076640 a(1)=1, a(n) = a(n-phi(n)) + 1. 2
1, 2, 2, 3, 2, 4, 2, 4, 3, 5, 2, 5, 2, 5, 3, 5, 2, 6, 2, 6, 4, 6, 2, 6, 3, 6, 4, 6, 2, 7, 2, 6, 3, 7, 3, 7, 2, 7, 4, 7, 2, 8, 2, 7, 5, 7, 2, 7, 3, 8, 3, 7, 2, 8, 4, 7, 5, 8, 2, 8, 2, 7, 5, 7, 3, 8, 2, 8, 4, 8, 2, 8, 2, 8, 4, 8, 3, 9, 2, 8, 5, 9, 2, 9, 5, 8, 3, 8, 2, 9, 3, 8, 4, 8, 3, 8, 2, 8, 5, 9, 2, 9, 2, 8, 6 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..10000

FORMULA

It seems that for n large enough : ln(n) < (1/n)*sum(k=1, n, a(k)) < ln(n)+ln(ln(n))

PROG

(PARI) a(n)=if(n<2, 1, a(n-eulerphi(n))+1)

CROSSREFS

A053475(n) - 1.

Sequence in context: A193513 A144373 A086292 * A169819 A134681 A144372

Adjacent sequences:  A076637 A076638 A076639 * A076641 A076642 A076643

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 23 2002

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 17 13:28 EST 2012. Contains 206031 sequences.