login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076143 Number of permutations p(1),...,p(n) of 1,...,n such that GCD( sum{k=1 to m} p(k), p(m+1) ) = 1 for all positive integers m <= n-1. 0
1, 2, 2, 8, 32, 80, 376, 1736, 15618, 118732, 412052, 3562696, 81378488 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Sequence in context: A003616 A079895 A053047 * A057132 A121197 A009543

Adjacent sequences:  A076140 A076141 A076142 * A076144 A076145 A076146

KEYWORD

nonn

AUTHOR

Leroy Quet Oct 31 2002

EXTENSIONS

More terms from Hans Havermann, Nov 01, 2002

2 more terms from David W. Wilson, Nov 02, 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.