login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
A051145(a(n)) = 2^n. - Reinhard Zumkeller, Jul 05 2014
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 ^)
-- Reinhard Zumkeller, Jul 05 2014
CROSSREFS
Cf. A000079, A051145, subsequence of A244747.
Sequence in context: A099420 A184794 A144728 * A316154 A079741 A000861
KEYWORD
nonn,easy,nice
AUTHOR
N. J. A. Sloane, E. M. Rains
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Oct 03 2000
a(21)-a(23) from Reinhard Zumkeller, Jul 05 2014
Definition corrected by Reinhard Zumkeller, Jul 05 2014
a(24)-a(30) from Charlie Neder, Oct 12 2018
More terms from Sean A. Irvine, Aug 25 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)