login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087034 Number of distinct values taken on by f(P)=Sum[p(i)p(n+1-i),i=1..n] as {p(1),p(2),...,p(n)} ranges over all permutations P of {1,2,3,...n}. 1
1, 1, 2, 3, 8, 9, 34, 35, 103, 77, 207, 138 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
See A087035 for the maximum value of f(P) as P ranges over all permutations of {1,2,3,...,n}. It appears that the corresponding minimum value of f(P) is given by A000292=C(n+3,3).
LINKS
EXAMPLE
a(3)=2, since f takes on exactly two distinct values 10 and 13: f({1,2,3})=10, f({1,3,2)}=13, f({2,1,3})=13, f({2,3,1})=13, f({3,1,2})=13 and f({3,2,1})=10.
CROSSREFS
Sequence in context: A119386 A162219 A140484 * A364382 A133165 A019307
KEYWORD
nonn
AUTHOR
John W. Layman, Jul 31 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 2 19:04 EDT 2024. Contains 372203 sequences. (Running on oeis4.)