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!)
A064787 Inverse permutation to A053212. 3
1, 2, 3, 4, 6, 5, 11, 7, 8, 9, 23, 10, 31, 15, 13, 12, 58, 14, 74, 16, 18, 29, 122, 17, 25, 40, 21, 22, 224, 19, 267, 20, 38, 69, 33, 24, 453, 89, 49, 26, 636, 28, 737, 43, 30, 141, 995, 27, 53, 35, 84, 57, 1523, 34, 59, 36, 108, 257, 2244, 32, 2528, 310, 41, 37, 77, 52 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is the index of A005179(n) in A007416; equivalently, a(n) is the number of minimal numbers (numbers in A007416) that are <= A005179(n). - Jianing Song, Aug 16 2022
LINKS
EXAMPLE
a(23) = 122 because d(n) (A000005(n)) takes 121 different values before it first reaches 23 (at n = 2^22).
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a064787 = (+ 1) . fromJust . (`elemIndex` a053212_list)
-- Reinhard Zumkeller, Apr 18 2015
CROSSREFS
Sequence in context: A263266 A263268 A257472 * A369137 A075160 A119755
KEYWORD
easy,nonn
AUTHOR
N. J. A. Sloane, Oct 20 2001
EXTENSIONS
More terms from Naohiro Nomoto, Oct 31 2001
More terms from David Wasserman, Aug 14 2002
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 13 03:15 EDT 2024. Contains 371639 sequences. (Running on oeis4.)