login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A163985
Sum of all isolated parts of all partitions of n.
4
0, 1, 2, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113
OFFSET
0,3
COMMENTS
Note that for n >= 3 the isolated parts of all partitions of n are n and n-1.
FORMULA
a(n) = n for n<3, a(n) = 2*n-1 for n>=3.
a(n) = A140139(n), n>=1.
a(n) = A130773(n-1), n >=2. - R. J. Mathar, Jan 25 2023
EXAMPLE
For n=4, the five partitions of 4 are {(4);(2,2);(3,1);(2,1,1);(1,1,1,1)}. Since 1 and 2 are repeated parts and 3 and 4 are not repeated parts (or isolated parts) then a(4) = 3 + 4 = 7.
MATHEMATICA
Join[{0, 1, 2}, Table[2 n - 1, {n, 3, 60}]] (* Vincenzo Librandi, Dec 23 2015 *)
PROG
(Magma) [0, 1, 2] cat [2*n-1: n in [3..60]]; // Vincenzo Librandi, Dec 23 2015
(PARI) a(n) = if (n<3, n, 2*n-1); \\ Michel Marcus, Dec 23 2015
CROSSREFS
KEYWORD
easy,nonn,less
AUTHOR
Omar E. Pol, Aug 14 2009
STATUS
approved