| 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 2, 1, 3, 1, 2, 2, 5, 2, 5, 3, 3, 4, 6, 3, 6, 4, 7, 6, 10, 4, 10, 7, 8, 7, 10, 7, 14, 8, 12, 8, 17, 10, 17, 12, 13, 14, 20, 12, 21, 14, 18, 16, 25, 15, 23, 18, 22, 20, 30, 16, 32, 21, 29, 23, 32, 21, 38, 27, 33, 26, 43, 25
(list; graph; listen)
|
|
|
OFFSET
|
1,11
|
|
|
COMMENT
|
a(n) = A051493(n) - A070102(n) - A070109(n).
|
|
LINKS
|
R. Zumkeller, Integer-sided triangles
|
|
EXAMPLE
|
For n=10 there are A005044(10) = 2 integer triangles: [2,4,4] and [3,3,4]; both are acute, but GCD(2,4,4)>1, therefore a(9) = 1.
|
|
CROSSREFS
|
Cf. A070080, A070081, A070082, A070093, A070096, A070099, A070084, A070119.
Adjacent sequences: A070091 A070092 A070093 this_sequence A070095 A070096 A070097
Sequence in context: A124579 A035306 A101691 this_sequence A105497 A132662 A132589
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 05 2002
|
|
