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!)

Revisions by G. C. Greubel

(See also G. C. Greubel's wiki page)

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

Showing entries 1-10 | older changes
A143229 a(n) = A000041(n) * A000070(n).
(history; published version)
#10 by G. C. Greubel at Tue Aug 27 04:33:11 EDT 2024
STATUS

editing

proposed

#9 by G. C. Greubel at Tue Aug 27 04:33:06 EDT 2024
LINKS

G. C. Greubel, <a href="/A143229/b143229_1.txt">Table of n, a(n) for n = 0..1000</a>

MATHEMATICA

A143229[n_]:= PartitionsP[n]*Sum[PartitionsP[k], {k, 0, n}];

Table[A143229[n], {n, 0, 50}] (* G. C. Greubel, Aug 27 2024 *)

PROG

(Magma)

A143229:= func< n | NumberOfPartitions(n)*(&+[NumberOfPartitions(k): k in [0..n]]) >;

[A143229(n): n in [0..50]]; // G. C. Greubel, Aug 27 2024

(SageMath)

def p(n): return number_of_partitions(n) # A000041

def A143229(n): return p(n)*sum(p(k) for k in range(n+1))

[A143229(n) for n in range(51)] # G. C. Greubel, Aug 27 2024

CROSSREFS

Cf. A143228, A000041, A000070, A143228.

KEYWORD

nonn,changed

nonn

STATUS

approved

editing

A143228 Triangle read by rows, T(n,k) = (p(n)*p(k)), where p(n) & p(k) = the number of partitions of n; 0<=k<=n.
(history; published version)
#5 by G. C. Greubel at Tue Aug 27 04:19:26 EDT 2024
STATUS

editing

proposed

#4 by G. C. Greubel at Tue Aug 27 04:18:07 EDT 2024
DATA

1, 1, 1, 2, 2, 4, 3, 3, 6, 9, 5, 5, 10, 15, 25, 7, 7, 14, 142121, 35, 49, 11, 11, 22, 33, 55, 77, 121, 15, 15, 30, 45, 75, 105, 165, 225, 22, 22, 44, 66, 110, 154, 242, 330, 484, 30, 30, 60, 90, 150, 210, 330, 450, 660, 900, 42, 42, 84, 126, 210, 294, 462, 462630630, 924, 1260, 1764

LINKS

G. C. Greubel, <a href="/A143228/b143228_1.txt">Rows n = 0..50 of the triangle, flattened</a>

CROSSREFS

Cf. A000012, A000041, A143229. (row sums).

Discussion
Tue Aug 27 04:19
G. C. Greubel: Added two commas that were missing to separate data values.
A143215 a(n) = prime(n) * Sum_{i=1..n} prime(i).
(history; published version)
#35 by G. C. Greubel at Tue Aug 27 04:10:47 EDT 2024
STATUS

editing

proposed

A143214 Gray code applied to Pascal's triangle: T(n,k) = GrayCode(binomial(n, k)).
(history; published version)
#17 by G. C. Greubel at Tue Aug 27 04:09:45 EDT 2024
STATUS

editing

proposed

#16 by G. C. Greubel at Tue Aug 27 04:09:37 EDT 2024
LINKS

G. C. Greubel, <a href="/A143214/b143214_1.txt">Rows n = 1..50 of the triangle, flattened</a>

EXTENSIONS

Edited by G. C. Greubel, Aug 27 2024

A143213 Triangle T(n,m) read by rows: Gray code of A060187(n, k) (decimal representation), 1 <= k <= n, n >= 1.
(history; published version)
#20 by G. C. Greubel at Tue Aug 27 04:06:03 EDT 2024
STATUS

editing

proposed

#19 by G. C. Greubel at Tue Aug 27 04:05:58 EDT 2024
EXTENSIONS

Edited by G. C. Greubel, Aug 27 2024

STATUS

proposed

editing

#18 by G. C. Greubel at Tue Aug 27 04:04:31 EDT 2024
STATUS

editing

proposed

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 27 16:23 EDT 2024. Contains 375470 sequences. (Running on oeis4.)