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-2 of 2 results.

A048137 Erroneous version of A005806.

Original entry on oeis.org

1, 1, 2, 14, 546, 16944
Offset: 1

Views

Author

Keywords

A009997 Number of comparative probability orderings on all subsets of n elements that can arise by assigning a probability distribution to the individual elements.

Original entry on oeis.org

1, 1, 1, 2, 14, 516, 124187, 214580603
Offset: 0

Views

Author

Keywords

Comments

Also 1/(2^n*n!) * number of regions of hyperplane arrangements with normals (0,1,-1)^n.
From David W. Wilson, Aug 15 2008: (Start)
Also, number of possible orderings of the set of divisors of a product of n distinct primes.
Let p1 < p2 < ... < p_n be primes (say p1 = p, p2 = q, p3 = r, ...) Consider the set M of divisors of p1*p2*...*p_n. How many ways can M be ordered?
For n = 0, we have m = { 1 }, with 1 ordering.
For n = 1, we have M = { 1, p }. There is 1 possible ordering, 1 < p.
For n = 2, we have M = { 1, p, q, pq }. Remembering p < q, there is again 1 possible ordering, 1 < p < q < pq.
For n = 3, we have M = { 1, p, q, r, pq, pr, qr, pqr }. There are 2 possible orderings here:
1 < p < q < r < pq < pr < qr < pqr,
1 < p < q < pq < r < pr < qr < pqr. (End)

Crossrefs

Programs

  • PARI
    apply( {A009997(n)=if(n>4, [516, 124187, 214580603][n-4], (n-=!!n)^n\/2)}, [0..7]) \\ M. F. Hasler, Mar 17 2023

Formula

a(n) <= A005806(n) with equality iff n <= 4. - M. F. Hasler, Mar 17 2023

Extensions

a(6) and a(7) from Diane Maclagan and Michael Kleber
Edited by N. J. A. Sloane, Nov 26 2008
a(0) = 1 inserted by M. F. Hasler, Mar 17 2023
Showing 1-2 of 2 results.