A212911 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A212911

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

1, 8, 7, 9, 13, 17, 37, 86, 157, 326, 941, 2811, 11878, 56054, 56053, 232966, 465926, 6988755, 25159587, 75478749, 880585235, 2641755693, 15850471389

(list; graph; refs; listen; history; text; internal format)

OFFSET

-1,2

COMMENTS

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

a(22) <= 218727080602. - Donovan Johnson, Jun 02 2012

LINKS

Table of n, a(n) for n=-1..21.

PROG

(Haskell)

import Data.List (elemIndex)

import Data.Maybe (fromJust)

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

CROSSREFS

Sequence in context: A094082 A318378 A198884 * A019326 A286839 A277915

Adjacent sequences: A212908 A212909 A212910 * A212912 A212913 A212914

KEYWORD

nonn,more

AUTHOR

Reinhard Zumkeller, May 30 2012

EXTENSIONS

a(17)-a(19) from Donovan Johnson, May 31 2012

a(20) from Donovan Johnson, Jun 02 2012

a(21) from Hans Havermann, Jun 22 2012

STATUS

approved