Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056138
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056138 Number of ways in which n can be the shorter leg (shortest side) of an integer sided right angled triangle. +0
2
0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 2, 1, 3, 3, 1, 1, 4, 2, 1, 3, 3, 1, 3, 1, 3, 4, 1, 3, 5, 1, 1, 4, 5, 1, 3, 1, 3, 5, 1, 1, 7, 2, 2, 4, 3, 1, 3, 3, 5, 4, 1, 1, 9, 1, 1, 5, 4, 4, 4, 1, 3, 4, 3, 1 (list; graph; listen)
OFFSET

1,9

FORMULA

a(n) = A046079(n)-A056137(n) = A046081(n)-A046080(n)-A056137(n)

CROSSREFS

Cf. A009004, A055525, A055527.

Sequence in context: A072038 A108316 A145574 this_sequence A067594 A089533 A054390

Adjacent sequences: A056135 A056136 A056137 this_sequence A056139 A056140 A056141

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 15 2000

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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research