login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070964 a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k). 1
1, 1, 2, 3, 7, 6, 20, 21, 44, 50, 143, 108, 376, 364, 738, 987, 2583, 1938, 6764, 6150, 13938, 17622, 46367, 34776, 113957, 121160, 257114, 306852, 832039, 549000, 2178308, 2178309, 4595932, 5701290, 13686704, 11197764, 39088168, 39083988 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
The 12th term is F(1) + F(5) + F(7) + F(11) = 1 + 5 + 13 + 89 = 108, where F(n) is the n-th Fibonacci number and 1, 5, 7 and 11 are the positive integers <= 12 and relatively prime to 12.
CROSSREFS
Cf. A000045 (Fibonacci numbers).
Sequence in context: A350408 A187015 A245467 * A111075 A011372 A104955
KEYWORD
nonn
AUTHOR
Leroy Quet, May 16 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)