|
|
A090532
|
|
Let f(n) = n - pi(n). Then a(n) = least number of steps such that f(f(...(n)))=1.
|
|
2
|
|
|
1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,3
|
|
LINKS
|
|
|
EXAMPLE
|
a(10) = 3, 10 ->6 ->3 ->1.
a(100) = 9.
f(100) =100-25 = 75, f(75) = 75-21= 54, f(54) = 54-16 = 38, f(38) = 38-12= 26, f(26) = 26-9 = 17, f(17) = 17-7 = 10, f(10) = 10-4 =6, f(6) = 6-3=3, f(3) = 3-2 =1.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Corrected and extended by Sam Handler (sam_5_5_5_0(AT)yahoo.com), Dec 11 2004
|
|
STATUS
|
approved
|
|
|
|