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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A253807 Primitive part of A006190(n), n >= 1. 2
 1, 3, 10, 11, 109, 12, 1189, 119, 1297, 131, 141481, 118, 1543321, 1429, 15445, 14159, 183642229, 1299, 2003229469, 14041, 1837837, 170039, 238367471761, 14158, 23854956949, 1854841, 2186871697, 1670761, 309400794703549 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A006190(n) = Prod(a(k), k divides n), n >= 1. LINKS FORMULA a(n) = ((3-sqrt(13))/2)^phi(n)*cyclotomic(n, -(11 - 3*sqrt13)/2) for n >= 1 and a(1) = 1, where phi is Euler's totient A000010 and the coefficient table for the cyclotomic polynomials is given in A013595. a(n) = product_(d|n)(A006190(d)^mu(n/d)), where mu = A008683, n >= 1. MATHEMATICA (* b = A006190 *) b[0] = 0; b[1] = 1; b[n_] := b[n] = 3*b[n-1] + b[n-2]; a[n_] := Product[b[d]^MoebiusMu[n/d], {d, Divisors[n]}]; Table[a[n], {n, 1, 30}] (* Jean-François Alcover, Jan 20 2015 *) CROSSREFS Cf. A000010, A013595, A061446 (with references), A008555, A105603. Sequence in context: A125569 A201156 A309525 * A212993 A272968 A020681 Adjacent sequences:  A253804 A253805 A253806 * A253808 A253809 A253810 KEYWORD nonn,easy AUTHOR Wolfdieter Lang, Jan 19 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 November 26 03:20 EST 2020. Contains 338632 sequences. (Running on oeis4.)