A239070 Smallest m such that A132995(m) = n-th squarefree number.

2, 1, 10, 62, 97, 22, 3, 224, 92, 5, 242, 120, 144, 40, 69, 858, 61, 142, 195, 456, 76, 265, 180, 1254, 189, 166, 338, 339, 1062, 757, 1162, 372, 682, 980, 252, 281, 202, 2350, 251, 2110, 1381, 804, 52, 625, 750, 910, 1057, 8, 541, 1082, 15, 486, 1414, 595

Offset

1,1

Comments

A132995(a(n)) = A005117(n) and A132995(m) <> A005117(n) for m < a(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..2000

Prog

(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a239070 = (+ 1) . fromJust . (`elemIndex` a132995_list) . a005117

Crossrefs

Sequence in context: A054781 A213421 A370068 * A271042 A098290 A160110

Adjacent sequences: A239067 A239068 A239069 * A239071 A239072 A239073

Keyword

nonn

Author

Reinhard Zumkeller, Mar 10 2014

Status

approved