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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155043 a(n) = 1 + a(n-sigma_0(n)), a(0)=0, sigma_0(n) number of divisors of n. 0
0, 1, 1, 2, 2, 3, 2, 4, 3, 3, 3, 4, 3, 5, 4, 5, 5, 6, 4, 7, 5, 7, 5, 8, 6, 6, 6, 9, 6, 10, 6, 11, 7, 11, 7, 12, 10, 13, 8, 13, 8, 14, 8, 15, 9, 14, 9, 15, 9, 10, 10, 16, 10, 17, 10, 17, 10, 18, 11, 19, 10, 20, 12, 19, 19, 21, 12, 22, 13, 22, 13, 23, 11, 24, 14, 23, 14, 25, 14, 26, 14, 15, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

REFERENCES

B. Balamohan, A. Kuznetsov and S. Tanny, On the behavior of a variant of Hofstadter's Q-sequence, J. Integer Sequences, Vol. 10 (2007), #07.7.1.

John A. Pelesko, Generalizing the Conway-Hofstadter $10,000 Sequence, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.5.

LINKS

Table of n, a(n) for n=0..82.

MAPLE

with(numtheory): a := proc (n) if n = 0 then 0 else 1+a(n-tau(n)) end if end proc: seq(a(n), n = 0 .. 90); [From Emeric Deutsch, Jan 26 2009]

CROSSREFS

Cf. A004001, A005185

Sequence in context: A144370 A087050 A163870 * A065770 A086375 A107324

Adjacent sequences:  A155040 A155041 A155042 * A155044 A155045 A155046

KEYWORD

nonn

AUTHOR

Ctibor O. Zizka, Jan 19 2009

EXTENSIONS

Extended by Emeric Deutsch, Jan 26 2009

STATUS

approved

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 May 23 16:56 EDT 2013. Contains 225610 sequences.