Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076143
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 2, 2, 8, 32, 80, 376, 1736, 15618, 118732, 412052, 3562696, 81378488 (list; graph; listen)
OFFSET

1,2

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

CROSSREFS

Sequence in context: A003616 A079895 A053047 this_sequence A057132 A121197 A009543

Adjacent sequences: A076140 A076141 A076142 this_sequence 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

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 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research