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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067953 Number of ways to sum numbers from 1 to n to the n-th prime. 6
0, 1, 1, 2, 2, 4, 7, 13, 23, 39, 69, 122, 211, 339, 564, 1001, 1764, 2630, 4565, 7192, 10151, 17202, 26152, 43543, 79126, 117496, 156229, 227302, 295011, 422040, 1004905, 1423445, 2210752, 2796140, 5225780, 6546101, 9921635, 14947534 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

a(n) = b(0, n), where b(m, n) satisfies b(m, n) = 1 + sum{b(i, j): m<i<j<n & i+j=prime(n)}.

a(n) < A000009(A000040(n)).

EXAMPLE

a(6)=4, as there are 4 decompositions for A000040(6)=13:

6+5+2 = 6+4+3 = 6+4+2+1 = 5+4+3+1 = 13.

PROG

(Haskell)

a067953 n = p [1..n] $ a000040 n where

   p _  0 = 1

   p [] _ = 0

   p (k:ks) m | m < k = 0 | otherwise = p ks (m - k) + p ks m

-- Reinhard Zumkeller, Nov 22 2011

CROSSREFS

Sequence in context: A179183 A095325 A153970 * A109070 A169973 A049868

Adjacent sequences:  A067950 A067951 A067952 * A067954 A067955 A067956

KEYWORD

nonn,nice

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 06 2002

EXTENSIONS

a(36)-a(38) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Aug 23 2010

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 23:53 EST 2012. Contains 205689 sequences.