This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A304095 a(n) is the number of the proper divisors of n that are Lucas numbers larger than 3 (4, 7, 11, 18, ...). 5
 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 1, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 2, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 0, 1, 2, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 2, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 2, 0, 1, 0, 2, 0, 0, 0, 2, 0, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,28 COMMENTS a(n) is the number of the proper divisors d of n that are of the form d = A000045(k-1) + A000045(k+1), for k >= 3. LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = Sum_{d|n, d>3, du2, old_u1=u1; u1=u2; u2=old_u1+u2); (u2==n)); }; A304095(n) = sumdiv(n, d, (d>3)*(d

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 July 23 19:33 EDT 2019. Contains 325263 sequences. (Running on oeis4.)