cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A194715 15 times triangular numbers.

Original entry on oeis.org

0, 15, 45, 90, 150, 225, 315, 420, 540, 675, 825, 990, 1170, 1365, 1575, 1800, 2040, 2295, 2565, 2850, 3150, 3465, 3795, 4140, 4500, 4875, 5265, 5670, 6090, 6525, 6975, 7440, 7920, 8415, 8925, 9450, 9990, 10545, 11115, 11700, 12300, 12915, 13545, 14190, 14850, 15525
Offset: 0

Views

Author

Omar E. Pol, Oct 03 2011

Keywords

Comments

Sequence found by reading the line from 0, in the direction 0, 15, ... and the same line from 0, in the direction 0, 45, ..., in the square spiral whose vertices are the generalized 17-gonal numbers.
Sum of the numbers from 7*n to 8*n. - Wesley Ivan Hurt, Dec 23 2015
Also the number of 4-cycles in the (n+6)-triangular honeycomb obtuse knight graph. - Eric W. Weisstein, Jul 28 2017

Crossrefs

Cf. A001105 (3-cycles in the triangular honeycomb obtuse knight graph), A290391 (5-cycles), A290392 (6-cycles). - Eric W. Weisstein, Jul 29 2017

Programs

Formula

a(n) = 15*n*(n+1)/2 = 15*A000217(n) = 5*A045943(n) = 3*A028895(n) = A069128(n+1) - 1.
From Wesley Ivan Hurt, Dec 23 2015: (Start)
G.f.: 15*x/(1-x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2.
a(n) = Sum_{i=7*n..8*n} i. (End)
From Amiram Eldar, Feb 21 2023: (Start)
Sum_{n>=1} 1/a(n) = 2/15.
Sum_{n>=1} (-1)^(n+1)/a(n) = (4*log(2) - 2)/15.
Product_{n>=1} (1 - 1/a(n)) = -(15/(2*Pi))*cos(sqrt(23/15)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (15/(2*Pi))*cos(sqrt(7/15)*Pi/2). (End)
E.g.f.: 15*exp(x)*x*(2 + x)/2. - Elmo R. Oliveira, Dec 25 2024