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!)
A212911 Smallest number m such that A212813(m) = n. 2

%I #15 Jun 22 2012 12:50:06

%S 1,8,7,9,13,17,37,86,157,326,941,2811,11878,56054,56053,232966,465926,

%T 6988755,25159587,75478749,880585235,2641755693,15850471389

%N Smallest number m such that A212813(m) = n.

%C A212813(a(n)) = n and A212813(m) < n for m < a(n).

%C a(22) <= 218727080602. - _Donovan Johnson_, Jun 02 2012

%o (Haskell)

%o import Data.List (elemIndex)

%o import Data.Maybe (fromJust)

%o a212911 = (+ 1) . fromJust . (`elemIndex` a212813_list)

%K nonn,more

%O -1,2

%A _Reinhard Zumkeller_, May 30 2012

%E a(17)-a(19) from _Donovan Johnson_, May 31 2012

%E a(20) from _Donovan Johnson_, Jun 02 2012

%E a(21) from _Hans Havermann_, Jun 22 2012

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 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)