A036483 a(n) = partition(11n+10) mod 11.

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

Offset: 0

Author

David W. Wilson

Keywords

• nonn
• easy

Links

• Amiram Eldar, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A000041, A020919.

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

Programs

Mathematica

a[n_] := Mod[PartitionsP[11*n + 10], 11]; Array[a, 100, 0] (* Amiram Eldar, Aug 01 2025 *)

PARI

a(n) = numbpart(11*n + 10) % 11; \\ Amiram Eldar, Aug 01 2025

Formula

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

Extensions

Offset corrected by Amiram Eldar, Aug 01 2025