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.

Showing 1-1 of 1 results.

A266875 Number of partially ordered sets ("posets") with n labeled elements, modulo n.

Original entry on oeis.org

0, 1, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 4, 3, 1, 9, 1
Offset: 1

Views

Author

Altug Alkan, Jan 05 2016

Keywords

Comments

If n is a prime number, a(n) = 1 because of the fact that A001035(p^k) == 1 mod p for all primes p.
If n is an even number, a(n) is a number of the form 3^k for n <= 19. How is the distribution of terms of the form 3^k in this sequence?

Examples

			a(4) = A001035(4) mod 4 = 219 mod 4 = 3.
a(5) = A001035(5) mod 5 = 4231 mod 5 = 1.
a(6) = A001035(6) mod 6 = 130023 mod 6 = 3.
a(7) = A001035(7) mod 7 = 6129859 mod 7 = 1.

Crossrefs

Cf. A001035, A265847.

Formula

a(n) = A001035(n) mod n, for n > 0.
a(A000040(n)) = A265847(A000040(n)) - 1, for n > 1.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.