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

 

Logo


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, d<n} A102460(d).

a(n) = A007949(A304102(n)).

EXAMPLE

The proper divisors of 28 are 1, 2, 4, 7 and 14. Of these 4 and 7 are Lucas numbers (A000032) larger than 3, thus a(28) = 2.

PROG

(PARI)

A102460(n) = { my(u1=1, u2=3, old_u1); if(n<=2, sign(n), while(n>u2, old_u1=u1; u1=u2; u2=old_u1+u2); (u2==n)); };

A304095(n) = sumdiv(n, d, (d>3)*(d<n)*A102460(d));

CROSSREFS

Cf. A000045, A000204, A102460, A304091, A304093, A304096, A304102.

Cf. also A300836.

Sequence in context: A285108 A030216 A159459 * A276675 A236389 A143078

Adjacent sequences:  A304092 A304093 A304094 * A304096 A304097 A304098

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 13 2018

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