A210032 a(n)=n for n=1,2,3 and 4; a(n)=5 for n >= 5.
1, 2, 3, 4, 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
- Dominika Závacká, Cristina Dalfó, and Miquel Angel Fiol, Integer sequences from k-iterated line digraphs, CEUR: Proc. 24th Conf. Info. Tech. - Appl. and Theory (ITAT 2024) Vol 3792, 156-161. See p. 161, Table 2.
- Index entries for linear recurrences with constant coefficients, signature (1).
Programs
-
Mathematica
Join[Range@4, Table[5, {83}]] (* Arkadiusz Wesolowski, Mar 29 2012 *) PadRight[{1,2,3,4},120,{5}] (* Harvey P. Dale, Sep 23 2017 *)
Formula
a(n) = min(n,5). - Wesley Ivan Hurt, Apr 16 2014
From Elmo R. Oliveira, Jun 26 2024: (Start)
G.f.: x*(1+x+x^2+x^3+x^4)/(1-x) = x*(1-x^5)/(1-x)^2.
Comments