login
A335901
a(n) = 2*a(floor((n-1)/a(n-1))) with a(1) = 1.
2
1, 2, 2, 2, 4, 2, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 8, 4, 8, 4, 4, 4, 4, 4, 8, 4, 8, 4, 4, 4, 4, 4, 8, 4, 8, 4, 8, 8, 8, 8, 8, 8, 8, 8, 4, 8, 4, 8, 4, 8, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 8, 4, 8, 4, 8, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
OFFSET
1,2
COMMENTS
Least k such that a(k) = 2^n are 1, 2, 5, 21, 169, 2705, ... (Conjecture: This sequence is A117261).
LINKS
MAPLE
f:= proc(n) option remember;
2*procname(floor((n-1)/procname(n-1))) end proc:
f(1):= 1:
map(f, [$1..105]); # Robert Israel, Jul 08 2020
MATHEMATICA
a[1] = 1; a[n_] := a[n] = 2 * a[Floor[(n-1)/a[n-1]]]; Array[a, 100] (* Amiram Eldar, Jun 29 2020 *)
PROG
(PARI) a=vector(10^3); a[1]=1; for(n=2, #a, a[n]=2*a[(n-1)\a[n-1]]); a
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Altug Alkan, following a suggestion from Andrew R. Booker, Jun 29 2020
STATUS
approved