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!)
A198259 a(n) = Sum_{k=1..n} F(n mod k) where F=A000045, the Fibonacci numbers. 2
0, 0, 1, 1, 3, 2, 6, 5, 9, 9, 17, 13, 26, 26, 39, 39, 66, 61, 104, 102, 156, 162, 265, 249, 405, 419, 646, 652, 1059, 1031, 1676, 1696, 2660, 2705, 4362, 4283, 6937, 7039, 11159, 11206, 18138, 17998, 29130, 29325, 46805, 47075, 76171, 75713, 122502, 123123 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) is asymptotic to (1/10)*(5+sqrt(5))*phi^ceiling(n/2) where phi=(1+sqrt(5))/2.
PROG
(Haskell)
a198259 n = sum $ map (a000045 . (mod n)) [1..n]
-- Reinhard Zumkeller, Oct 22 2011
CROSSREFS
Cf. A001622.
Sequence in context: A268823 A046877 A067587 * A120476 A069159 A306389
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 22 2011
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 March 29 02:13 EDT 2024. Contains 371264 sequences. (Running on oeis4.)