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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075850 Greatest k such that f(k,1) divides f(k,n) where f(k,n) is the k-th term of the sequence : f(1,n)=1 f(2,n)= n f(k+2,n)=f(k+1,n)+f(k,n) (f(k,1) is the Fibonacci sequence). 0
1, 2, 3, 4, 3, 5, 4, 2, 6, 4, 5, 2, 4, 7, 3, 5, 6, 2, 4, 2, 5, 8, 3, 2, 6, 5, 7, 4, 3, 2, 5, 2, 6, 4, 9, 5, 4, 2, 3, 7, 6, 2, 8, 2, 3, 5, 3, 2, 6, 2, 5, 4, 7, 2, 4, 10, 6, 4, 3, 2, 5, 2, 3, 8, 6, 7, 4, 2, 9, 4, 5, 2, 6, 2, 3, 5, 3, 2, 7, 2, 6, 4, 3, 2, 8, 5, 3, 4, 6, 11, 5, 7, 3, 4, 3, 5, 6, 2, 3, 4, 5, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

It seems that sum(i=1, n, a(i) ) is asymptotic to C*n where 4 < C < 9/2

CROSSREFS

Sequence in context: A322973 A305890 A305801 * A327565 A054437 A287821

Adjacent sequences:  A075847 A075848 A075849 * A075851 A075852 A075853

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Oct 15 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 10:24 EDT 2019. Contains 328317 sequences. (Running on oeis4.)