|
%I #45 Nov 10 2022 12:36:36
%S 1,1,2,3,3,4,5,4,5,7,5,6,8,5,8,10,5,8,10,7,10,11,7,8,13,9,9,14,7,12,
%T 15,6,12,13,11,15,14,8,10,19,10,12,18,8,16,19,9,12,17,14,16,16,10,15,
%U 21,15,14,20,7,16,25,7,20,21,14,18,18,14,12,26,16,17
%N Number of partitions of n into consecutive parts, all singletons except the largest.
%C Number of representations of n as the difference of two distinct triangular numbers, plus any multiple of the order of the larger triangular number.
%C From _Jeremy Lovejoy_, Nov 10 2022: (Start)
%C For n > 0, a(n) is also equal to the Hurwitz class number H(8n-1).
%C a(n) is also equal to the number of partitions y of n having no repeated even parts and smallest part odd, counted according to the weight w(y) = (-1)^(the number of even parts)*(the number of occurrences of the smallest part). For example, the partitions of 6 having no repeated even parts and smallest part odd are [5,1], [4,1,1], [3,3], [3,2,1], [3,1,1,1], [2,1,1,1,1], and [1,1,1,1,1,1], which are counted with weights 1,-2,2,-1,3,-4, and 6, giving a(6) = 1-2+2-1+3-4+6 = 5. (End)
%H Chai Wah Wu, <a href="/A321440/b321440.txt">Table of n, a(n) for n = 0..10000</a>
%H C. Alfes, K. Bringmann, and J. Lovejoy, <a href="https://doi.org/10.1017/S0305004111000375">Automorphic properties of generating functions for generalized odd rank moments and odd Durfee symbols</a>, Math. Proc. Cambridge Philos. Soc. 151 (2011), no. 3, 385-406.
%H Dandan Chen and Rong Chen, <a href="https://arxiv.org/abs/2107.04809">Generating Functions of the Hurwitz Class Numbers Associated with Certain Mock Theta Functions</a>, arXiv:2107.04809 [math.NT], 2021.
%H N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, <a href="https://vimeo.com/314786942">Part I</a>, <a href="https://vimeo.com/314790822">Part 2</a>, <a href="https://oeis.org/A320487/a320487.pdf">Slides.</a> (Mentions this sequence)
%F From _Jeremy Lovejoy_, Nov 10 2022: (Start)
%F G.f.: 1 + Sum_{n>=0} x^(n+1)*Product_{k=1..n} (1-x^(2*k))/Product_{k=1..n+1} (1-x^(2*k-1)).
%F G.f.: 1 + Sum_{n>=1} (-1)^(n+1)*x^(n^2)/((1-x^(2*n-1))*Product_{k=1..n} (1-x^(2*k-1))). (End)
%e Here are the derivations of the terms given. Partitions are listed as strings of digits.
%e n = 0: (empty partition)
%e n = 1: 1
%e n = 2: 11, 2
%e n = 3: 111, 12, 3
%e n = 4: 1111, 22, 4
%e n = 5: 11111, 122, 23, 5
%e n = 6: 111111, 123, 222, 33, 6
%e n = 7: 1111111, 1222, 34, 7
%e n = 8: 11111111, 2222, 233, 44, 8
%e n = 9: 111111111, 12222, 1233, 234, 333, 45, 9
%e n = 10: 1111111111, 1234, 22222, 55, (10)
%o (Python)
%o from sympy.utilities.iterables import partitions
%o def A321440(n):
%o return 1 if n == 0 else sum(1 for s,p in partitions(n,size=True) if len(p)-1 == max(p)-min(p) == s-p[max(p)]) # _Chai Wah Wu_, Nov 09 2018
%o from __future__ import division
%o def A321440(n): # a faster program based on the characterization in the comments
%o if n == 0:
%o return 1
%o c = 0
%o for i in range(n):
%o mi = i*(i+1)//2 + n
%o for j in range(i+1,n+1):
%o k = mi - j*(j+1)//2
%o if k < 0:
%o break
%o if not k % j:
%o c += 1
%o return c # _Chai Wah Wu_, Nov 09 2018
%Y See comment by _Emeric Deutsch_ at A001227 (partitions into consecutive parts, all singletons); the partitions considered in the present sequence are a superset of those described by Deutsch.
%Y Cf. A259825, A321441, A321443.
%K nonn
%O 0,3
%A _Allan C. Wechsler_, Nov 09 2018
%E More terms from _Chai Wah Wu_, Nov 09 2018
|
