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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081420 Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0. 0
0, 1, 1, 1, 1, 1, 4, 18, 19, 5, 25, 31, 11, 64, 89, 4, 24, 31, 29, 184, 236, 45, 285, 319, 76, 486, 499, 121, 759, 639, 199, 1230, 855, 20, 120, 59, 521, 3038, 916, 841, 4727, 341, 1364, 7386, 1189, 2205, 11445, 4889 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

Usually a(3n-2)=A001350(n)

LINKS

Table of n, a(n) for n=1..48.

FORMULA

It seems that limit n-->infinity r(n)=(9+sqrt(5))/2

EXAMPLE

If n=3 f(k)=floor(r(3)*F(k))+g(k) where r(3)=(9-sqrt(5))/4 is the root of 4*X^2-18*X+19=0 and g(k) is the 6-periodic sequence (0,0,-1,-1,0,-1)

CROSSREFS

Sequence in context: A205105 A231957 A275952 * A039277 A045019 A103061

Adjacent sequences:  A081417 A081418 A081419 * A081421 A081422 A081423

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 20 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 17:41 EST 2019. Contains 329847 sequences. (Running on oeis4.)