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.

A020919 Partition numbers mod 11.

Original entry on oeis.org

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

Views

Author

Keywords

Comments

Zeros are uncommonly dense at beginning of sequence, no other modulus exhibits this behavior.

Crossrefs

Programs

  • Mathematica
    Mod[PartitionsP[Range[0,120]],11] (* Harvey P. Dale, May 14 2023 *)
  • PARI
    a(n) = numbpart(n) % 11; \\ Michel Marcus, Jul 14 2022

Formula

a(n) = A000041(n) mod 11. - Sean A. Irvine, May 04 2019