login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258437 Smallest number m such that A258383(m) = n. 7
9, 1, 302, 332, 465460 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

let m = A258432(a(n)): A062234(m) = A062234(m-1+k) for k=1..n.

LINKS

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

EXAMPLE

.   n |    a(n) | A258432(a(n))              |     Run in A062234

. ----+---------+----------------------------+--------------------------

.   1 |       5 |             9 = A258469(1) | [17]

.   2 |       1 |             1 = A257762(1) | [1, 1]

.   3 |     265 |           302 = A258449(1) | [1995, 1995, 1995]

.   4 |     290 |           332 = A257892(1) | [2235, 2235, 2235, 2235]

.   5 |  440676 |        465460 = A257951(1) | [ ___ 5 x 6824895 ___ ]

PROG

(Haskell)

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

a258437 = (+ 1) . fromJust . (`elemIndex` a258383_list)

CROSSREFS

Cf. A062234, A258383, A258432, A258469, A257762, A258449, A257892, A257951.

Sequence in context: A254932 A223511 A051231 * A046761 A193373 A246564

Adjacent sequences:  A258434 A258435 A258436 * A258438 A258439 A258440

KEYWORD

nonn,more

AUTHOR

Reinhard Zumkeller, May 31 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 March 30 16:16 EDT 2020. Contains 333127 sequences. (Running on oeis4.)