Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070964
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070964 Sum{1<=k<=n,GCD(k,n)=1} Fibonacci(k). +0
2
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; listen)
OFFSET

1,3

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

The 12_th 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

Sequence in context: A115304 A098285 A019585 this_sequence A111075 A011372 A104955

Adjacent sequences: A070961 A070962 A070963 this_sequence A070965 A070966 A070967

KEYWORD

nonn

AUTHOR

Leroy Quet May 16 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research