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.

Previous Showing 11-14 of 14 results.

A117542 Number of permutations P of 1..n such that in P and in the inverse of P, every pair of adjacent numbers and the first and last number, are relatively prime.

Original entry on oeis.org

1, 2, 6, 8, 36, 16, 127, 320, 581, 1564, 13565, 13760, 149186, 773727, 540538
Offset: 1

Views

Author

Giovanni Resta, Mar 28 2006

Keywords

Comments

Sequence suggested by Leroy Quet on the SeqFan mailing list.

Examples

			a(4)=8, since the 8 permutations (1,2,3,4), (1,4,3,2), (2,1,4,3), (2,3,4,1), (4,1,2,3), (3,2,1,4), (3,4,1,2), (4,3,2,1) satisfy the property.
		

Crossrefs

A168078 Number of matrices with elements 1..n in which every pair of adjacent elements are relatively prime.

Original entry on oeis.org

1, 4, 12, 32, 144, 176, 1728, 4320, 27936
Offset: 1

Views

Author

Lior Manor, Nov 18 2009

Keywords

Comments

For prime p, a(p) = 2*A076220(p)

Crossrefs

A116542 Table B(m,n), read by antidiagonals, where B(m,n) is the number of ways integers 1,..,m*n can be put into an m X n grid so that every adjacent (NESW) pair of integers are coprime.

Original entry on oeis.org

1, 2, 2, 6, 8, 6, 12, 16, 16, 12, 72, 432, 2016, 432, 72, 72, 2784, 23904, 23904, 2784, 72, 864, 35712, 7102656, 19611648, 7102656, 35712, 864
Offset: 1

Views

Author

Giovanni Resta, Mar 28 2006

Keywords

Comments

Sequence suggested by Leroy Quet on the SeqFan mailing list. B(1,n)=B(n,1)=A076220(n).

Examples

			The 16 configuration 3x2 are the following
------------------------------------------------
1 2 3 | 2 5 6 | 3 4 1 | 4 5 6 | 6 1 2 | 6 5 4
6 5 4 | 3 4 1 | 2 5 6 | 3 2 1 | 5 4 3 | 1 2 3
------------------------------------------------
1 4 3 | 3 2 1 | 3 4 5 | 5 2 3 | 6 1 4
6 5 2 | 4 5 6 | 2 1 6 | 6 1 4 | 5 2 3
------------------------------------------------
2 1 6 | 3 2 5 | 4 1 6 | 5 4 3 | 6 5 2
3 4 5 | 4 1 6 | 3 2 5 | 6 1 2 | 1 4 3
------------------------------------------------
		

Crossrefs

Cf. A076220.

A369330 Number of permutations of (1, 2, ..., n) in which any two adjacent elements differ by a power of 2.

Original entry on oeis.org

1, 1, 2, 6, 12, 48, 140, 338, 926, 4390, 15990, 52766, 187688, 557768, 1772354, 5865806, 18707354, 102862912, 456146172, 1833942698, 7914142056, 30247599368, 120022505534, 492976337746, 1992746442918, 7203060422116, 27454886930170, 106007544478780, 398728610528654
Offset: 0

Views

Author

Pontus von Brömssen, Jan 20 2024

Keywords

Comments

The number of (directed) Hamiltonian paths in the graph with vertex set {1, 2, ..., n} and edges between vertices that differ by a power of 2.

Crossrefs

Extensions

a(22) from Alois P. Heinz, Jan 20 2024
a(23) from Andrew Howroyd, Jan 20 2024
a(24)-a(28) from Martin Ehrenstein, Mar 02 2024
Previous Showing 11-14 of 14 results.