A003981 Inverse Möbius transform of A003965.

1, 3, 4, 7, 6, 12, 9, 15, 13, 18, 14, 28, 22, 27, 24, 31, 35, 39, 56, 42, 36, 42, 90, 60, 31, 66, 40, 63, 145, 72, 234, 63, 56, 105, 54, 91, 378, 168, 88, 90, 611, 108, 988, 98, 78, 270, 1598, 124, 73, 93, 140, 154, 2585, 120, 84, 135, 224, 435, 4182, 168, 6766, 702

Offset: 1

Author

Marc LeBrun

Keywords

• nonn
• easy
• mult

Links

• N. J. A. Sloane, Transforms.

Crossrefs

Cf. A000045, A000720, A003965.

Programs

Mathematica

f[p_, e_] := Module[{q = Fibonacci[PrimePi[p] + 2]}, (q^(e+1)-1)/(q-1)]; a[n_] := Times @@ f @@@ FactorInteger[n]; a[1] = 1; Array[a, 100] (* Amiram Eldar, Sep 04 2023 *)

Formula

Multiplicative with a(p^e) = (q^(e+1)-1)/(q-1) where q = Fibonacci(pi(p)+1) = A000045(A000720(p)+2). - David W. Wilson, Sep 01 2001

Extensions

More terms from David W. Wilson, Aug 29 2001