The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105214 Companion sequence to A103683: a(n) = k if A103683(k) = n; a(n) = 0 if n is not in {A103683}. 2
 1, 2, 3, 6, 4, 46, 5, 10, 7, 22, 8, 50, 9, 14, 11, 18, 12, 54, 13, 26, 21, 30, 15, 58, 16, 34, 17, 42, 19, 62, 20, 38, 25, 70, 31, 66, 23, 74, 29, 78, 24, 102982, 27, 86, 41, 82, 28, 102974, 35, 98, 33, 90, 32, 102978, 36, 102, 37, 106, 39, 102990, 40, 94, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A103683 is injective. Inverse of A103683. Conjecture: a(42 + 6*k) = 0.  This would follow from the conjecture that for n >= 67, A103683(n) is divisible by 3 iff n == 3 mod 4 and by 2 iff n == 2 mod 4. - Robert Israel, May 12 2015 The conjecture is false; a(42) = 102982. - Rémy Sigrist, Jan 05 2022 LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Rémy Sigrist, C program for A105214 EXAMPLE a(6) = 46 because A103683(46) = 6. MATHEMATICA f[s_] := Block[{k = 1, l = Take[s, -3]}, While[ Union[ GCD[k, l]] != {1} || MemberQ[s, k], k++]; Append[s, k]]; Take[Ordering@ Nest[f, {1, 2, 3}, 200], 41] (* Robert G. Wilson v, Jun 26 2011 *) PROG (C) See Links section. CROSSREFS Cf. A103683. Sequence in context: A091507 A098282 A034855 * A136315 A011159 A091556 Adjacent sequences:  A105211 A105212 A105213 * A105215 A105216 A105217 KEYWORD nonn AUTHOR Leroy Quet and Robert G. Wilson v, Apr 13 2005 EXTENSIONS More terms from Rémy Sigrist, Jan 05 2022 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 20 13:06 EST 2022. Contains 350472 sequences. (Running on oeis4.)