login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A344420 a(n) = floor(n/11). 2
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,23
COMMENTS
Terms agree with A064458 for all n < 121, but a(121) = 11 while A064458(121) = 12.
LINKS
FORMULA
From Chai Wah Wu, May 18 2021: (Start)
a(n) = a(n-1) + a(n-11) - a(n-12) for n > 11.
G.f.: x^11/(x^12 - x^11 - x + 1). (End)
MATHEMATICA
Floor[Range[0, 100]/11]
CoefficientList[Series[x^11/(x^12-x^11-x+1), {x, 0, 100}], x] (* or *) LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}, 100] (* Harvey P. Dale, Aug 03 2021 *)
CROSSREFS
Cf. A064458, A059995 (floor n/10).
Sequence in context: A287272 A300287 A226764 * A206244 A206245 A064458
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, May 17 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 07:38 EDT 2024. Contains 371782 sequences. (Running on oeis4.)