login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A343407 Number of proper divisors of n that are triangular numbers. 1
0, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 3, 1, 2, 2, 1, 1, 3, 1, 1, 2, 1, 1, 5, 1, 1, 2, 1, 1, 3, 1, 1, 2, 2, 1, 4, 1, 1, 3, 1, 1, 3, 1, 2, 2, 1, 1, 3, 1, 2, 2, 1, 1, 5, 1, 1, 3, 1, 1, 3, 1, 1, 2, 2, 1, 4, 1, 1, 3, 1, 1, 3, 1, 2, 2, 1, 1, 5, 1, 1, 2, 1, 1, 6, 1, 1, 2, 1, 1, 3, 1, 1, 2, 2, 1, 3, 1, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
G.f.: Sum_{k>=1} x^(k*(k+1)) / (1 - x^(k*(k+1)/2)).
a(n) = Sum_{d|n, d < n} A010054(d).
MAPLE
a:= n-> add(`if`(issqr(8*d+1), 1, 0), d=numtheory[divisors](n) minus {n}):
seq(a(n), n = 1..105); # Alois P. Heinz, Apr 14 2021
MATHEMATICA
nmax = 105; CoefficientList[Series[Sum[x^(k (k + 1))/(1 - x^(k (k + 1)/2)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
Table[Sum[If[d < n && IntegerQ[Sqrt[8 d + 1]], 1, 0], {d, Divisors[n]}], {n, 105}]
PROG
(PARI) a(n) = sumdiv(n, d, if ((d<n), ispolygonal(d, 3))); \\ Michel Marcus, Apr 14 2021
CROSSREFS
Sequence in context: A051064 A280509 A153096 * A359236 A320010 A210763
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 14 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 22 03:57 EDT 2024. Contains 375354 sequences. (Running on oeis4.)