login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A096901
Number of permutations p of (1,2,3,...,n) such that k+p(k) is a triangular number for 1<=k<=n.
0
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,9
FORMULA
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 triangular number or not.
CROSSREFS
KEYWORD
nonn
AUTHOR
Ray Chandler, Jul 26 2004
EXTENSIONS
More terms from David Wasserman, Nov 27 2007
a(0) and a(31)-a(38) from Martin Ehrenstein, Mar 03 2024
STATUS
approved