This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A111295 #22 Sep 01 2021 11:44:07
%S A111295 1,5,15,42,101,231,490,1002,1958,3718,6842,12310,21637,37338,63261,
%T A111295 105558,173525,281589,451276,715220,1121505,1741630,2679689,4087968,
%U A111295 6185689,9289091,13848650,20506255,30167357,44108109,64112359,92669720,133230930,190569292
%N A111295 Number of partitions of 3n+1.
%C A111295 Old name was: P(3*n + 1) where P(m) is the unrestricted partition of m and n = 1,2,3,... .
%C A111295 a(n) is also the number of partitions of 4n-2 that include n as a part; see Comment at A000041. - _Clark Kimberling_, Mar 03 2014
%H A111295 Seiichi Manyama, <a href="/A111295/b111295.txt">Table of n, a(n) for n = 0..10000</a>
%F A111295 a(n) = A000041(A016777(n)). - _Michel Marcus_, Sep 01 2021
%e A111295 If n=25 then P(3*25 + 1) = 9289091.
%t A111295 Table[PartitionsP[3 n + 1], {n, 0, 10}]
%o A111295 (PARI) a(n) = numbpart(3*n+1); \\ _Michel Marcus_, Mar 04 2014
%Y A111295 Cf. A000041, A016777, A058695.
%K A111295 nonn
%O A111295 0,2
%A A111295 _Parthasarathy Nambi_, Nov 01 2005
%E A111295 Better name from _Clark Kimberling_, Mar 02 2014