login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096066 Triangle read by rows, 1<=k<=n: T(n,k) = number of occurrences of the k-th prime in partitions of the n-th prime into primes, 0<=k<n. 0
1, 0, 1, 1, 1, 1, 3, 1, 1, 1, 10, 6, 2, 1, 1, 16, 9, 4, 2, 1, 1, 37, 22, 11, 6, 2, 1, 1, 54, 32, 15, 9, 3, 2, 1, 1, 107, 65, 32, 19, 7, 5, 2, 1, 1, 266, 165, 84, 50, 22, 15, 7, 5, 2, 1, 353, 219, 112, 69, 30, 21, 10, 7, 3, 1, 1, 779, 487, 254, 157, 73, 52, 27, 19, 10, 3, 2, 1, 1270, 795 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,7

COMMENTS

T(n,n)=1.

EXAMPLE

n=5, A000040(5)=11 with A056768(5)=6 partitions into primes:

T(5,1)=10 prime(1)=2 in 7+2+2=5+2+2+2=3+3+3+2=3+2+2+2+2,

T(5,2)=6 prime(2)=3: in 5+3+3=3+3+3+2=3+2+2+2+2,

T(5,3)=2 prime(3)=5: in 5+3+3=5+2+2+2,

T(5,4)=1 prime(4)=7: in 7+2+2.

CROSSREFS

Cf. A056768.

Sequence in context: A156535 A080214 A185620 * A064085 A152795 A121585

Adjacent sequences:  A096063 A096064 A096065 * A096067 A096068 A096069

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 21 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:32 EST 2012. Contains 205635 sequences.