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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A342696 a(n) = floor(n/12). 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,25
COMMENTS
Agrees with A064459 for n < 144, but a(144) = 12 whereas A064459(144) = 13.
LINKS
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).
FORMULA
G.f.: x^12 / ( (1+x)*(1+x^2)*(x^4-x^2+1)*(x^2-x+1)*(1+x+x^2)*(x-1)^2 ). - R. J. Mathar, Jul 08 2021
a(n) = a(n-1) + a(n-12) - a(n-13). - Wesley Ivan Hurt, Oct 29 2022
MATHEMATICA
Floor[Range[0, 200]/12]
CROSSREFS
Cf. A064459, A221912 (partial sums), A344420 (floor n/11).
Sequence in context: A095861 A111855 A071701 * A064459 A279758 A082996
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, May 18 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 December 4 04:23 EST 2023. Contains 367541 sequences. (Running on oeis4.)