Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070084
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070084 Greatest common divisor of sides of integer triangles [A070080(n), A070081(n), A070082(n)], sorted by perimeter, sides lexicographically ordered. +0
22
1, 1, 2, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 3, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 7, 2, 1, 2, 1, 1, 1 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n)>1 iff there exists a smaller similar triangle [A070080(k), A070081(k), A070082(k)] with k<n and A070080(n)=A070080(k)*a(n), A070081(n)=A070081(k)*a(n) and A070082(n)=A070082(k)*a(n).

LINKS

R. Zumkeller, Integer-sided triangles

FORMULA

a(n) = GCD(A070080(n), A070081(n), A070082(n)).

CROSSREFS

Cf. A051493, A005044, A070091, A070094, A070102, A070109, A070110, A070113, A070116, A070119, A070128, A070137.

Sequence in context: A101446 A062760 A014649 this_sequence A060176 A010248 A132068

Adjacent sequences: A070081 A070082 A070083 this_sequence A070085 A070086 A070087

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 05 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 November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research