login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A113178 Sum{p|n} F(p), where F(p) is the pth Fibonacci number and where the sum is over the distict prime divisors of n. 1
0, 1, 2, 1, 5, 3, 13, 1, 2, 6, 89, 3, 233, 14, 7, 1, 1597, 3, 4181, 6, 15, 90, 28657, 3, 5, 234, 2, 14, 514229, 8, 1346269, 1, 91, 1598, 18, 3, 24157817, 4182, 235, 6, 165580141, 16, 433494437, 90, 7, 28658, 2971215073, 3, 13, 6, 1599, 234 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

Additive with a(p^e) = F(p).

EXAMPLE

12 = 2^2 * 3^1, so a(12) = F(2) + F(3) = 1 + 2 = 3.

MATHEMATICA

b[t_]:=Fibonacci[First[t]] a[n_]:=Apply[Plus, Map[b, FactorInteger[n]]] (Peuha)

CROSSREFS

Cf. A113177, A000045.

Sequence in context: A179218 A131119 A114901 * A108362 A171090 A141506

Adjacent sequences:  A113175 A113176 A113177 * A113179 A113180 A113181

KEYWORD

nonn

AUTHOR

Leroy Quet Oct 16 2005

EXTENSIONS

More terms from Esa Peuha (esa.peuha(AT)helsinki.fi), Oct 26 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:37 EST 2012. Contains 205860 sequences.