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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030770 a(n) = least k such that s(k) = n, where s = A030767. 0
2, 1, 6, 5, 9, 14, 15, 21, 22, 30, 68, 31, 41, 229, 42, 54, 170, 55, 69, 173, 70, 87, 174, 88, 107, 175, 348, 108, 205, 237, 130, 272, 176, 153, 309, 177, 310, 207, 444, 351, 445, 273, 397, 311, 239, 732, 353, 274, 499, 669, 399, 312 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..52.

CROSSREFS

Cf. A030767.

Sequence in context: A156993 A308431 A292667 * A307048 A188652 A333958

Adjacent sequences: A030767 A030768 A030769 * A030771 A030772 A030773

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 December 3 15:03 EST 2022. Contains 358534 sequences. (Running on oeis4.)