Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A261013

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A261013 Irregular triangle read by rows: T(n,k) = number of partitions of n into prime parts in which the largest part is the k-th prime.
(history; published version)
#16 by Bruno Berselli at Tue Dec 06 10:58:04 EST 2016
STATUS

proposed

approved

#15 by Jean-François Alcover at Tue Dec 06 09:58:29 EST 2016
STATUS

editing

proposed

#14 by Jean-François Alcover at Tue Dec 06 09:58:23 EST 2016
MATHEMATICA

b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, b[n, i-1] + Function[p, If[p>n, 0, b[n-p, i]]][Prime[i]]]]; T[n_] := If[n == 1, 0, Table[b[n - Prime[k], k], {k, 1, PrimePi[n]}]]; Table[T[n], {n, 1, 25}] // Flatten (* Jean-François Alcover, Dec 06 2016 after Alois P. Heinz *)

STATUS

approved

editing

#13 by Alois P. Heinz at Sun Aug 16 19:32:32 EDT 2015
STATUS

editing

approved

#12 by Alois P. Heinz at Sun Aug 16 19:32:26 EDT 2015
DATA

0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 2, 1, 1, 1, 1, 2, 1, 0, 2, 2, 1, 1, 1, 2, 2, 2, 0, 0, 2, 3, 2, 1, 1, 1, 2, 3, 3, 1, 0, 0, 3, 4, 3, 1, 1, 1, 2, 4, 4, 2, 1, 0, 3, 5, 5, 2, 1, 1, 1, 3, 5, 5, 3, 2, 0, 0, 3, 6, 7, 3, 2, 1, 1, 1, 3, 7, 7, 4, 3, 1, 0

STATUS

approved

editing

#11 by Alois P. Heinz at Sun Aug 16 19:30:49 EDT 2015
STATUS

editing

approved

#10 by Alois P. Heinz at Sun Aug 16 19:30:46 EDT 2015
KEYWORD

nonn,tabf,look,new

STATUS

approved

editing

#9 by Alois P. Heinz at Sun Aug 16 19:29:48 EDT 2015
STATUS

editing

approved

#8 by Alois P. Heinz at Sun Aug 16 19:29:44 EDT 2015
LINKS

Alois P. Heinz, <a href="/A261013/b261013.txt">Rows n = 1..500, flattened</a>

MAPLE

with(numtheory):

b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,

b(n, i-1)+(p-> `if`(p>n, 0, b(n-p, i)))(ithprime(i))))

end:

T:= n-> `if`(n=1, 0, seq(b(n-ithprime(k), k), k=1..pi(n))):

seq(T(n), n=1..25); # Alois P. Heinz, Aug 16 2015

#7 by Alois P. Heinz at Sun Aug 16 19:25:11 EDT 2015
DATA

0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 2, 1, 1, 1, 1, 2, 1, 0, 2, 2, 1, 1, 1, 2, 2, 2, 0, 0, 2, 3, 2, 1, 1, 1, 2, 3, 3, 1, 0, 0, 3, 4, 3, 1, 1, 1, 2, 4, 4, 2, 1, 0, 3, 5, 5, 2, 1, 1, 1, 3, 5, 5, 3, 2, 0, 0, 3, 6, 7, 3, 2, 1, 1

OFFSET

1,2122

KEYWORD

nonn,tabf,more,new

EXTENSIONS

More terms from Alois P. Heinz, Aug 16 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 20:50 EDT 2024. Contains 375284 sequences. (Running on oeis4.)