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”).

A073110
Number of permutations p of (1,2,3,...,n) such that sigma(1+p(1))+sigma(2+p(2))+...+sigma(n+p(n))=2*n^2.
0
0, 1, 0, 2, 10, 37, 121, 725, 5160, 31794, 279136, 2137531, 21305316, 213311303, 2457648287, 30357607661, 387013387043, 5245097770693
OFFSET
1,4
COMMENTS
It seems that for any permutation p of (1,2,3,...,n) for n>3, the equation: sigma(1+p(1))+sigma(2+p(2))+...+sigma(n+p(n))=m*n^2 has solutions for m=2 only.
PROG
(PARI) a(n)=sum(k=1, n!, if(sum(i=1, n, sigma(i+component(numtoperm(n, k), i)))-2*n^2, 0, 1))
CROSSREFS
Sequence in context: A236767 A154323 A191349 * A034547 A246604 A124646
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Aug 19 2002
EXTENSIONS
2 more terms from Ryan Propper, Aug 27 2005
a(12)-a(18) from Robert Gerbicz, Nov 21 2010
STATUS
approved