login
This site is supported by donations 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..30.

FORMULA

A051145(a(n)) = 2^n. - Reinhard Zumkeller, Jul 05 2014

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

Adjacent sequences:  A051144 A051145 A051146 * A051148 A051149 A051150

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

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 04:56 EDT 2019. Contains 322310 sequences. (Running on oeis4.)