login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064689 Smallest m such that A064672(m) = n. 2
0, 1, 2, 3, 6, 7, 12, 15, 32, 43, 48, 61, 136, 159, 240, 527, 572, 1009, 1022, 1085, 1910, 2365, 3782, 6377, 13384, 17929, 18736, 25521, 57840, 155021, 258058, 266247, 267278, 278751, 315806, 328269 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

LINKS

Table of n, a(n) for n=0..35.

PROG

(Haskell)

import Data.List (elemIndex)

import Data.Maybe (fromJust)

a064689 = fromJust . (`elemIndex` a064672_list)

-- Reinhard Zumkeller, Apr 27 2012

CROSSREFS

Cf. A064672.

Sequence in context: A182538 A030013 A130404 * A240175 A238590 A144120

Adjacent sequences:  A064686 A064687 A064688 * A064690 A064691 A064692

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms from Vladeta Jovovic, Oct 13 2001

Initial term added and offset adjusted by Reinhard Zumkeller, Apr 27 2012

STATUS

approved

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 November 12 14:42 EST 2019. Contains 329058 sequences. (Running on oeis4.)