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.

A161981 A006128(n) mod n.

Original entry on oeis.org

0, 1, 0, 0, 0, 5, 5, 6, 2, 2, 0, 3, 10, 10, 3, 7, 10, 16, 2, 10, 4, 1, 17, 22, 1, 20, 24, 21, 11, 23, 28, 31, 30, 4, 16, 14, 18, 3, 4, 26, 29, 9, 42, 8, 15, 5, 29, 43, 38, 18, 32, 32, 22, 1, 3, 3, 28, 21, 32, 51, 30, 46, 39, 19, 52, 16, 30, 1, 2, 68, 65, 70, 57, 73, 42, 1, 21, 25, 44, 72, 17, 71
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Jun 23 2009

Keywords

Comments

The remainder of (the total number of parts in all partitions of n) mod n.

Examples

			a(1)=0=1 mod 1. a(2)=1=3 mod 2. a(3)=0=6 mod 3. a(4)=0=12 mod 4. a(5)=0=20 mod 5. a(6)=5=35 mod 6.
		

Crossrefs

Extensions

Edited, a 3 inserted, and extended by R. J. Mathar, Aug 02 2009