|
|
A051147
|
|
Smallest m such that A051145(m) = 2^n.
|
|
3
|
|
|
1, 2, 3, 5, 9, 12, 17, 29, 45, 81, 105, 177, 245, 323, 569, 893, 1277, 2121, 3221, 4853, 7697, 11015, 15333, 25841, 40157, 59213, 84239, 135107, 184679, 265277, 445029, 606509, 830411, 1394489, 1973405, 2683997, 4176989, 6710687, 9906153, 15114275, 22269021
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Block[{a, b, s}, a[0] = 0; a[1] = 1; a[n_] := a[n] = (b = 0; While[b++; BitOr[b, a[n - 1]] <= BitOr[a[n - 2], a[n - 1]]]; b); s = Array[a, 2^10, 0]; Array[FirstPosition[s, 2^#][[1]] - 1 &, Floor@ Log2@ Max@ s + 1, 0]] (* Michael De Vlieger, Aug 25 2021, after Jean-François Alcover at A051145 *)
|
|
PROG
|
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a051147 = fromJust . (`elemIndex` a051145_list) . (2 ^)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Oct 03 2000
|
|
STATUS
|
approved
|
|
|
|