login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064689 Smallest m such that A064672(m) = n. 2

%I

%S 0,1,2,3,6,7,12,15,32,43,48,61,136,159,240,527,572,1009,1022,1085,

%T 1910,2365,3782,6377,13384,17929,18736,25521,57840,155021,258058,

%U 266247,267278,278751,315806,328269

%N Smallest m such that A064672(m) = n.

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

%o (Haskell)

%o import Data.List (elemIndex)

%o import Data.Maybe (fromJust)

%o a064689 = fromJust . (`elemIndex` a064672_list)

%o -- _Reinhard Zumkeller_, Apr 27 2012

%Y Cf. A064672.

%K nonn,easy

%O 0,3

%A Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 09 2001

%E More terms from _Vladeta Jovovic_, Oct 13 2001

%E Initial term added and offset adjusted by _Reinhard Zumkeller_, Apr 27 2012

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 July 15 23:32 EDT 2020. Contains 335774 sequences. (Running on oeis4.)