OFFSET
1,1
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1000
Wikipedia, Lagrange's theorem (group theory).
Index entries for linear recurrences with constant coefficients, signature (2,-1).
FORMULA
a(n) = 2*n for n >= 3.
Proof: By Lagrange's theorem in group theory we have that n divides a(n) for all n. A group of order n and with an element of order n is the cyclic group of order n, hence being abelian. On the other hand, the dihedral group D_{2n} is non-abelian for n >= 3 and contains an element of order n. - Jianing Song, Aug 11 2023
G.f.: 2*x*(3 - 3*x + x^3)/(1 - x)^2. - Andrew Howroyd, Nov 14 2025
From Elmo R. Oliveira, May 29 2026: (Start)
E.g.f.: x*(2*exp(x) + x + 4).
a(n) = 2*a(n-1) - a(n-2) for n > 4. (End)
MATHEMATICA
Join[{6, 6}, 2*Range[3, 60]] (* Paolo Xausa, Jan 23 2026 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Yue Yu, Apr 01 2023
STATUS
approved
