a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.
1, 4, 10, 30, 65, 173, 343, 778, 1518, 3088, 560
6 seqfan posts
Mon Jun 4 05:46:34 CEST 2012 [seqfan] Re: Seqs needing more terms; Like OEIS; San Diego 2013
Mon Jun 4 05:39:51 CEST 2012 [seqfan] Re: Seqs needing more terms; Like OEIS; San Diego 2013
Mon Jun 4 05:22:09 CEST 2012 [seqfan] Re: Seqs needing more terms; Like OEIS; San Diego 2013
Mon Jun 4 05:18:20 CEST 2012 [seqfan] Re: Seqs needing more terms; Like OEIS; San Diego 2013
Mon Jun 4 05:09:57 CEST 2012 [seqfan] Re: Seqs needing more terms; Like OEIS; San Diego 2013
Mon Jun 4 04:41:37 CEST 2012 [seqfan] Seqs needing more terms; Like OEIS; San Diego 2013
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.