A096680 -id:A096680 - cp's OEIS frontend

A006063 A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a cube for every i.

7, 19, 26, 37, 44, 56, 63, 66, 68, 80, 82, 85, 87, 98, 100, 103, 105, 110, 112, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 135, 147, 149, 150, 151, 152, 155, 156, 159, 171, 173, 174, 175, 176, 177, 178, 179

Offset: 1

N. J. A. Sloane

nonn

Apparently Gardner (1975) quotes Papaikonomou as showing that there can be at most one solution for a given n. However, this is incorrect: see A096680 for n values with more than one such permutation. - Ray Chandler

For any n, the number of permutations is permanent(m), where the n X n matrix m is defined m(i,j) = 1 or 0, depending on whether i+j is a cube or not. Hence, n is in this sequence if permanent(m) > 0.

M. Gardner, Mathematical Games column, Scientific American, Mar 1975.
M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 81.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Cf. A095986 (for squares), A096680.

Conjecture: a(n) = n + 124 for n >= 173, i.e. there is such a permutation for every n >= 173. Verified for 173 <= n <= 1000. - Robert Israel, Aug 28 2018

Entry revised Jul 18 2004 based on comments from Franklin T. Adams-Watters

a(8) and later terms from Ray Chandler, Jul 26 2004

A096904 A card-arranging problem: number of permutations p_1, ..., p_n of 1, ..., n such that i + p_i is a cube for every i.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 4, 0, 0, 4, 4, 5, 1, 2, 1, 1, 1, 1, 2, 3, 7, 3, 10, 6, 5, 1, 1, 4, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 3, 30, 37, 1963, 1289, 1560

Offset: 1

Ray Chandler, Aug 01 2004

nonn

Cf. A006063, A096680.

a(n) = permanent(m), where the n X n matrix m is defined by m(i,j) = 1 or 0, depending on whether i+j is a cube or not.

A096901 Number of permutations p of (1,2,3,...,n) such that k+p(k) is a triangular number for 1<=k<=n.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 1, 1, 2, 4, 3, 9, 14, 13, 52, 124, 161, 181, 715, 2338, 7073, 8624, 15466, 52858, 150365, 316543, 691771, 1681604, 5324919, 15407311, 37417775, 69725286, 155786456, 579599171, 2600274145, 10530031625, 22971756045, 47057778714, 112946192928

Offset: 0

Ray Chandler, Jul 26 2004

nonn

Cf. A006063, A073364, A095986, A097082, A097083, A096680.

cp's OEIS Frontend

A006063 A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a cube for every i.

Views

Author

Keywords

Comments

References

Crossrefs

Formula

Extensions

A096904 A card-arranging problem: number of permutations p_1, ..., p_n of 1, ..., n such that i + p_i is a cube for every i.

Views

Author

Keywords

Crossrefs

Formula

A096901 Number of permutations p of (1,2,3,...,n) such that k+p(k) is a triangular number for 1<=k<=n.

Views

Author

Keywords

Crossrefs

Formula

Extensions