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!)
 A324060 Smallest positive index m such that A000009(m) is divisible by n. 2
 1, 3, 5, 6, 7, 8, 33, 9, 13, 10, 14, 11, 23, 33, 12, 16, 31, 13, 17, 31, 40, 14, 18, 27, 65, 23, 15, 33, 52, 32, 42, 16, 26, 31, 41, 38, 28, 17, 32, 37, 112, 41, 149, 79, 35, 18, 121, 27, 203, 65, 49, 23, 40, 19, 26, 33, 87, 52, 50, 41, 24, 42, 41, 20, 32, 79 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Analogous to A046641. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..20000 MAPLE b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(      `if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)     end: a:= proc(n) local k; for k while irem(b(k), n)>0 do od; k end: seq(a(n), n=1..100);  # Alois P. Heinz, Aug 17 2019 MATHEMATICA t[_] := 0; k = 1; f[n_] := Block[{p = PartitionsQ@n, lst}, lst = Select[Range@100, Mod[p, #] == 0 &]; If[t[#] == 0, t[#] = n] & /@ lst]; While[k < 1001, f[k]; k++]; t@# & /@ Range@100 CROSSREFS Cf. A000009, A046641. Sequence in context: A047583 A010906 A114309 * A323828 A079581 A229858 Adjacent sequences:  A324057 A324058 A324059 * A324061 A324062 A324063 KEYWORD nonn AUTHOR Robert G. Wilson v, Jul 31 2019 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 February 20 04:38 EST 2020. Contains 332063 sequences. (Running on oeis4.)