A267649 a(0) = a(1) = 2 then a(n) = 4 for n>=2.
2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
Offset: 0
Examples
a(0) = 2 because 1 is the smallest non-identity element in zeration and 1[0]1=2; a(1) = 2 because 1 is the smallest non-identity element in addition and 1[1]1=2; a(2) = 4 because 2 is the smallest non-identity element in multiplication and 2[2]2=4; a(3) = 4 because 2 is the smallest non-identity element in exponentiation and 2[2]2=4; a(4) = 4 because 2 is the smallest non-identity element in titration and 2[2]2=4; Etc.
Links
- Index entries for linear recurrences with constant coefficients, signature (1).
Crossrefs
Formula
a(n) = a[n]b where a,b are the positive smallest non-right-identity elements.
From Elmo R. Oliveira, Aug 06 2024: (Start)
G.f.: 4/(1 - x) - 2*(1 + x).
E.g.f.: 4*exp(x) - 2*(1 + x). (End)
Comments