This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119849 Nonzero values of A119842, in order of appearance. 2
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 1, 2, 1, 1, 1, 14, 1, 1, 1, 1, 1, 1, 1, 1, 22, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 14, 1, 1, 1, 1, 1, 2, 1, 252, 1, 1, 1, 5, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,24 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..3323 MATHEMATICA b[s_, t_] := b[s, t] = If[Length[s] < 1, 1, Sum[If[Mod[PrimeOmega[x], 2] == 1 - t && Length[Select[s, Mod[#, x] == 0 &]] == 1, b[s~Complement~{x}, 1 - t], 0], {x, s}]]; a[n_] := a[n] = Module[{l, m}, l = Sort[ FactorInteger[n], #1[[2]] > #2[[2]] &]; m = Product[Prime[i]^l[[i]][[2]], {i, 1, Length[l]}]; b[Divisors[m][[2 ;; -2]], Mod[PrimeOmega[m], 2]]]; Reap[For[ k = 1, k < 200, k++, If[a[k] > 0, Print[k, " ", a[k]]; Sow[a[k]]]]][[2, 1]] (* Jean-François Alcover, Mar 03 2016, after Alois P. Heinz *) CROSSREFS a(n) = A119842(A119848(n)). Sequence in context: A194321 A194852 A158854 * A246588 A026492 A182284 Adjacent sequences:  A119846 A119847 A119848 * A119850 A119851 A119852 KEYWORD nonn AUTHOR Antti Karttunen, Jun 04 2006 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 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)