Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060146
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060146 Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of unique solutions for n. +0
1
1, 1, 7, 21, 190, 1007, 6972, 111554 (list; graph; listen)
OFFSET

1,3

COMMENT

The old entry with this sequence number was a duplicate of A048298.

PROGRAM

(PARI) /* from Max Alekseyev */

{ npairs(n) = loca(r, q, z); r=0;

forvec(p=vector(n, i, [1, 2*n]),

q = eval( setminus( Set(vector(2*n, i, i)), Set(p) ) );

for(j=1, n!,

z=numtoperm(n, j);

if(type( sum(j=1, #p, p[j]/q[z[j]]) )=="t_INT", r++); ); , 2); r }

CROSSREFS

Sequence in context: A028248 A032032 A084711 this_sequence A111878 A133279 A082826

Adjacent sequences: A060143 A060144 A060145 this_sequence A060147 A060148 A060149

KEYWORD

nonn

AUTHOR

Jack Brennen (jb(AT)brennen.net), May 13 2008

EXTENSIONS

a(6)-a(8) from Max Alekseyev (maxale(AT)gmail.com), May 14 2008

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 28 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 17:24 EST 2009. Contains 170342 sequences.


AT&T Labs Research