|
|
A364803
|
|
Smallest number that reaches a fixed point after n iterations of the map x -> A022290(x).
|
|
1
|
|
|
0, 4, 5, 6, 7, 10, 14, 23, 46, 117, 442, 3006, 47983, 2839934, 918486751, 3769839124330
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is the smallest number k such that A364801(k) = n.
|
|
LINKS
|
|
|
MATHEMATICA
|
f[n_] := f[n] = Module[{d = IntegerDigits[n, 2], nd}, nd = Length[d]; Total[d * Fibonacci[Range[nd + 1, 2, -1]]]]; (* A022290 *)
iternum[n_] := -2 + Length@ FixedPointList[f, n]; (* A364801 *)
seq[kmax_] := Module[{s = {}, imax = -1, i}, Do[i = iternum[k]; If[i > imax, imax = i; AppendTo[s, k]], {k, 0, kmax}]; s]
seq[10^6]
|
|
PROG
|
(PARI) f(n) = {my(b = binary(n), nb = #b); sum(i = 1, nb, b[i] * fibonacci(nb - i + 2)); } \\ A022290
iternum(n) = if(n < 4, 0, iternum(f(n)) + 1); \\ A364801
lista(kmax) = {my(imax = -1, i1); for(k = 0, kmax, i = iternum(k); if(i > imax, imax = i; print1(k, ", "))); }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|