Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082024
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082024 Number of partitions of n into 3 parts which have common divisors. +0
2
0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 0, 4, 0, 4, 3, 5, 0, 9, 0, 9, 5, 10, 0, 16, 2, 14, 7, 17, 0, 27, 0, 21, 11, 24, 6, 36, 0, 30, 15, 37, 0, 51, 0, 41, 25, 44, 0, 64, 4, 58, 25, 57, 0, 81, 12, 69, 31, 70, 0, 108, 0, 80, 43, 85, 16, 123, 0, 97, 45, 120, 0, 144, 0, 114, 69, 121, 14, 171, 0 (list; graph; listen)
OFFSET

0,11

COMMENT

a(p) = 0 if p is a prime. Can any one suggest a formula?

EXAMPLE

a(14) = 4 and the partitions are (10,2,2), (8,4,2),(6,6,2) and (6,4,4).

a(13) = 0 as for all r + s + t = 13,r > 0, s > 0,t> 0 GCD(r,s,t) = 1.

MATHEMATICA

a[n_] := Length[Select[Flatten[Table[{a, b, n-a-b}, {a, 1, Floor[n/3]}, {b, a, Floor[(n-a)/2]}], 1], GCD@@#1>1&]]

CROSSREFS

Cf. A082023.

Sequence in context: A046769 A145893 A137561 this_sequence A114402 A035647 A065806

Adjacent sequences: A082021 A082022 A082023 this_sequence A082025 A082026 A082027

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 07 2003

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 20 2003 and Dean Hickerson (dean.hickerson(AT)yahoo.com), Apr 22 2003

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research