A008605 Multiples of 23.

0, 23, 46, 69, 92, 115, 138, 161, 184, 207, 230, 253, 276, 299, 322, 345, 368, 391, 414, 437, 460, 483, 506, 529, 552, 575, 598, 621, 644, 667, 690, 713, 736, 759, 782, 805, 828, 851, 874, 897, 920, 943, 966, 989, 1012, 1035, 1058, 1081, 1104, 1127, 1150

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..1000
• Tanya Khovanova, Recursive Sequences.
• INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 335.
• Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
• Index entries for linear recurrences with constant coefficients, signature (2,-1).

Crossrefs

Cf. A008602, A008603, A008604, A008606.

Programs

Mathematica

Range[0, 1500, 23] (* Vladimir Joseph Stephan Orlovsky, Jun 01 2011 *)
CoefficientList[Series[23 x / (x - 1)^2, {x, 0, 60}], x] (* Vincenzo Librandi, Jun 10 2013 *)

PARI

a(n)=23*n \\ Charles R Greathouse IV, Oct 07 2015

Formula

G.f.: 23*x/(x-1)^2. - Vincenzo Librandi, Jun 10 2013

E.g.f.: 23*x*exp(x). - Stefano Spezia, Mar 02 2025

From Elmo R. Oliveira, Apr 10 2025: (Start)

a(n) = 23*n = (A008604(n) + A008606(n))/2.

a(n) = 2*a(n-1) - a(n-2). (End)