This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095975 -a(n) is inverse EULER transform of -A000041(n). 3
 1, 2, 5, 11, 27, 60, 147, 344, 839, 2031, 5017, 12379, 30921, 77407, 195121, 493451, 1253613, 3194303, 8166757, 20933754, 53798919, 138566312, 357647565, 924834079, 2395702801, 6215748612, 16150985071, 42024182520, 109485000777, 285578913962, 745728542725 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 N. J. A. Sloane, Transforms FORMULA Moebius transform of A055890(n). a(n) ~ d^n / n, d = 2.69832910647421123126399866618837... (see A246828). - Vaclav Kotesovec, Aug 25 2014 MAPLE with(numtheory): b:= proc(n) option remember; `if`(n=0, 1, add(add(d, d=divisors(j)) *b(n-j), j=1..n)/n) end: c:= proc(n) option remember; local j; add(c(j) *b(n-j), j=1..n-1)-n*b(n) end: a:= -proc(n) option remember; local d; `if`(n=0, 1, add(mobius(n/d)*c(d), d=divisors(n))/n) end: seq(a(n), n=1..40); # Alois P. Heinz, Sep 09 2008 MATHEMATICA b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d, {d, Divisors[j]}]*b[n-j], {j, 1, n}]/n]; c[n_] := c[n] = Sum[c[j]*b[n-j], {j, 1, n-1}] - n*b[n]; a[n_] := -If[n == 0, 1, Sum[MoebiusMu[n/d]*c[d], {d, Divisors[n]}]/n]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Feb 24 2015, after Alois P. Heinz *) CROSSREFS Cf. A055887, A246828. Sequence in context: A067922 A212567 A266545 * A006652 A238825 A073225 Adjacent sequences:  A095972 A095973 A095974 * A095976 A095977 A095978 KEYWORD easy,nonn AUTHOR Vladeta Jovovic, Jul 20 2004 EXTENSIONS More terms from Alois P. Heinz, Sep 09 2008 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 September 15 12:22 EDT 2019. Contains 327078 sequences. (Running on oeis4.)