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!)
A257122 Smallest m such that A257218(m) = n. 3
1, 2, 3, 5, 8, 4, 30, 6, 10, 7, 123, 12, 201, 31, 9, 13, 300, 11, 825, 16, 34, 124, 946, 14, 27, 202, 21, 32, 3094, 15, 7060, 18, 127, 301, 54, 20, 13528, 826, 205, 17, 28659, 33, 40811, 125, 25, 947, 46658, 19, 81, 28, 304, 203, 57450, 22, 134, 38, 829, 3095 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A257218(a(n)) = n and A257218(m) != n for m < a(n);

it appears that all records > 8 occur at primes;

for p prime: a(p)-1 = index of the smallest multiple of p in A257218.

LINKS

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..72

PROG

(Haskell)

import Data.List (elemIndex); import Data.Maybe (fromJust)

a257122 = (+ 1) . fromJust . (`elemIndex` a257218_list)

CROSSREFS

Cf. A257218.

Sequence in context: A191455 A191540 A191450 * A249188 A284188 A011158

Adjacent sequences:  A257119 A257120 A257121 * A257123 A257124 A257125

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Apr 25 2015

EXTENSIONS

a(41)-a(58) from Hiroaki Yamanouchi, May 04 2015

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 January 24 19:03 EST 2022. Contains 350565 sequences. (Running on oeis4.)