This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A253169 Smallest m such that A256188(m) = n. 3
 1, 2, 9, 5, 6, 36, 10, 11, 12, 100, 17, 18, 19, 20, 225, 26, 27, 28, 29, 30, 441, 37, 38, 39, 40, 41, 42, 784, 50, 51, 52, 53, 54, 55, 56, 1296, 65, 66, 67, 68, 69, 70, 71, 72, 2025, 82, 83, 84, 85, 86, 87, 88, 89, 90, 3025, 101, 102, 103, 104, 105, 106, 107 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A256188(a(n)) = n and A256188(m) != n for m < a(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 FORMULA a(n) = if n triangular then n^2 else A004202(n + 1 - A002024(n)). PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a253169 = (+ 1) . fromJust . (`elemIndex` a256188_list) CROSSREFS Cf. A256188, A000537, A010054, A000290. Sequence in context: A201397 A077124 A051491 * A171052 A021342 A069857 Adjacent sequences:  A253166 A253167 A253168 * A253170 A253171 A253172 KEYWORD nonn AUTHOR Reinhard Zumkeller, Mar 26 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.

Last modified January 24 02:04 EST 2019. Contains 319407 sequences. (Running on oeis4.)