This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A215011 a(n) = least k>0 such that triangular(n) divides Fibonacci(k). 3
 1, 4, 12, 15, 20, 8, 24, 12, 60, 10, 60, 84, 56, 40, 60, 18, 36, 36, 90, 120, 40, 120, 24, 300, 175, 252, 72, 168, 140, 60, 60, 60, 180, 360, 120, 228, 342, 252, 420, 60, 40, 88, 660, 60, 120, 48, 48, 168, 1400, 900, 252, 189, 108, 180, 120, 72, 252, 406, 1740 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Triangular(n)=n*(n+1)/2 is the n-th triangular number. LINKS EXAMPLE Triangular(2)=3, least k>0 such that 3 divides Fibonacci(k) is k=4, so a(2)=4. PROG (Python) TOP = 333 prpr = y = 0 prev = k = 1 res = [-1]*TOP while y

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.

Last modified October 19 16:17 EDT 2019. Contains 328223 sequences. (Running on oeis4.)