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

%I #14 Oct 26 2019 18:00:10

%S 1,1,2,3,7,6,20,21,44,50,143,108,376,364,738,987,2583,1938,6764,6150,

%T 13938,17622,46367,34776,113957,121160,257114,306852,832039,549000,

%U 2178308,2178309,4595932,5701290,13686704,11197764,39088168,39083988

%N a(n) = Sum_{1<=k<=n, gcd(k,n)=1} Fibonacci(k).

%e 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.

%Y Cf. A000045 (Fibonacci numbers).

%K nonn

%O 1,3

%A _Leroy Quet_, May 16 2002

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 May 2 06:11 EDT 2024. Contains 372178 sequences. (Running on oeis4.)