Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077053
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077053 Greatest common divisor of indecomposable Wallis pairs. +0
3
1, 1, 1, 1, 2, 1, 2, 2, 1, 4, 1, 1, 1, 1, 2, 1, 1, 2, 1, 4, 1, 1, 3, 1, 4, 1, 1, 1, 1, 1, 1, 8, 1, 4, 5, 1, 8, 4, 1, 1, 1, 1, 1, 8 (list; graph; listen)
OFFSET

0,5

COMMENT

Terms > 1 show that (x,y) need not be a Wallis pair if (cx,cy) is a Wallis pair.

FORMULA

a(n) = gcd(A075768(n), A075769(n))

CROSSREFS

Cf. A072182, A072186, A075768, A075769.

Sequence in context: A029287 A055184 A035388 this_sequence A060438 A106190 A029290

Adjacent sequences: A077050 A077051 A077052 this_sequence A077054 A077055 A077056

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 22 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research