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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034748 Dirichlet convolution of Fibonacci numbers with phi(n). 1
1, 2, 4, 6, 9, 14, 19, 30, 44, 68, 99, 168, 245, 402, 636, 1026, 1613, 2650, 4199, 6854, 10996, 17820, 28679, 46596, 75065, 121650, 196516, 318250, 514257, 832826, 1346299, 2179374, 3524796, 5704516, 9227571, 14933352, 24157853, 39092386 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

From definition a(n)=sum(d dividing n, F(d)*phi(n/d)); also a(n)=sum(k=1, n, GCD(F(k), F(k+n)) where F(k) denotes the k-th Fibonacci number. - Benoit Cloitre (benoit7848c(AT)orange.fr), May 25 2003

PROG

(PARI) a(n)=sumdiv(n, d, fibonacci(d)*eulerphi(n/d))

CROSSREFS

Sequence in context: A117842 A067588 A003402 * A069916 A153140 A139135

Adjacent sequences:  A034745 A034746 A034747 * A034749 A034750 A034751

KEYWORD

nonn

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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 12:41 EST 2012. Contains 205909 sequences.