cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A036476 a(n) = partition(11n+2) mod 11.

Original entry on oeis.org

2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 4, 4, 4, 4, 4, 6, 6, 4, 6, 6, 6, 6, 8, 8, 8, 8, 10, 8, 10, 10, 1, 1, 1, 1, 3, 3, 5, 3, 5, 5, 7, 7, 9, 9, 0, 0, 2, 2, 4, 4, 6, 6, 8, 8, 1, 1, 3, 3, 7, 7, 9, 9, 2, 2, 6, 6, 10, 10, 3, 3, 7, 9, 0, 2, 6, 8, 1, 1, 7, 9, 2, 2, 8, 10, 5, 7, 2, 2, 8, 10, 7, 9, 4, 6, 3
Offset: 0

Views

Author

Keywords

Crossrefs

partition(11n+k): A036485 (k=0), A036475 (k=1), this sequence (k=2), A036477 (k=3), A036478 (k=4), A036479 (k=5), A000004 (k=6), A036480 (k=7), A036481 (k=8), A036482 (k=9), A036483 (k=10).

Programs

  • Mathematica
    Table[Mod[PartitionsP[11n+2],11],{n,0,110}] (* Harvey P. Dale, Jul 29 2017 *)
  • PARI
    a(n) = numbpart(11*n + 2) % 11; \\ Amiram Eldar, Aug 01 2025

Formula

a(n) = A020919(11*n + 2). - Amiram Eldar, Aug 01 2025

Extensions

Offset corrected by Amiram Eldar, Aug 01 2025