A094324 a(n) = 5 written in base n.
11111, 101, 12, 11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
Offset: 1
Links
- Index entries for linear recurrences with constant coefficients, signature (1).
Formula
From Elmo R. Oliveira, Jun 15 2024: (Start)
G.f.: x*(11111-11010*x-89*x^2-x^3-x^4-5*x^5)/(1-x).
a(n) = 5 for n > 5. (End)
Comments