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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257120 Position of first occurrence of n in A256918. 5
 1, 4, 3, 5, 7, 11, 29, 13, 10, 15, 122, 19, 200, 31, 24, 18, 299, 22, 824, 16, 33, 124, 945, 41, 26, 202, 21, 37, 3093, 45, 7059, 40, 126, 301, 53, 66, 13527, 826, 204, 42, 28658, 36, 40810, 130, 57, 947, 46657, 64, 80, 44, 303, 208, 57449, 49, 133, 38, 828 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A256918(a(n)) = n and A256918(m) != n for m < a(n); GCD(A257218(a(n)),A257218(a(n)+1)) = n; if A257218 is a permutation, then also this sequence is a permutation; a(n) < A257475(n); a(n) = A257475(n) - A257478(n). a(n) >= A257122(n)-1. - Ivan Neretin, May 02 2015 LINKS Hiroaki Yamanouchi, Table of n, a(n) for n = 1..72 EXAMPLE See A257478. PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a257120 = (+ 1) . fromJust . (`elemIndex` a256918_list) CROSSREFS Cf. A256918, A257475, A257478, A257218. Sequence in context: A317530 A171021 A035427 * A306835 A033546 A236360 Adjacent sequences:  A257117 A257118 A257119 * A257121 A257122 A257123 KEYWORD nonn AUTHOR Reinhard Zumkeller, Apr 25 2015 EXTENSIONS a(41)-a(57) from Hiroaki Yamanouchi, May 03 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 October 1 19:29 EDT 2020. Contains 337444 sequences. (Running on oeis4.)