[go: up one dir, main page]

login

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”).

Search: a248737 -id:a248737
     Sort: relevance | references | number | modified | created      Format: long | short | data
Smallest number m such that A248737(m) = n.
+20
2
0, 1, 2, 3, 69, 5, 9, 7, 40, 171, 365, 11, 805, 13, 217, 49, 637, 17, 1519, 19, 671, 125, 403, 23, 143, 2891, 1199, 1351, 917, 29, 559, 31, 799, 1099, 323, 14443, 949, 37, 803, 5027, 679, 41, 2167, 43, 1837, 6253, 341, 47, 253, 2327, 169, 4697, 2021, 53
OFFSET
0,3
COMMENTS
A248737(a(n)) = n and A248737(m) != n for m < a(n).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..90
PROG
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a257173 = fromJust . (`elemIndex` a248737_list)
CROSSREFS
Cf. A248737.
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 17 2015
STATUS
approved

Search completed in 0.006 seconds