A218171 -id:A218171 - cp's OEIS frontend

A154293 Integers of the form t/6, where t is a triangular number (A000217).

0, 1, 6, 11, 13, 20, 35, 46, 50, 63, 88, 105, 111, 130, 165, 188, 196, 221, 266, 295, 305, 336, 391, 426, 438, 475, 540, 581, 595, 638, 713, 760, 776, 825, 910, 963, 981, 1036, 1131, 1190, 1210, 1271, 1376, 1441, 1463, 1530, 1645, 1716, 1740, 1813, 1938, 2015

Offset: 1

Vladimir Joseph Stephan Orlovsky, Jan 06 2009

Old definition was "Integers of the form: 1/6+2/6+3/6+4/6+5/6+...".
1/6 + 2/6 + 3/6 = 1, 1/6 + 2/6 + 3/6 + 4/6 + 5/6 + 6/6 + 7/6 + 8/6 = 6, ...
a(n) is the set of all integers k such that 48k+1 is a perfect square. The square roots of 48*a(n) + 1 = 1, 7, 17, 23, 25, ... = 8*(n-floor(n/4)) + (-1)^n. - Gary Detlefs, Mar 01 2010
Conjecture: A193828 divided by 2. - Omar E. Pol, Aug 19 2011
The above conjecture is correct. - Charles R Greathouse IV, Jan 02 2012
Quasipolynomial of order 4. - Charles R Greathouse IV, Jan 02 2012
It appears that the sequence terms occur as exponents in the expansion Sum_{n >= 0} x^n/Product_{k = 1..2*n} (1 + x^k) = 1 + x - x^6 - x^11 + x^13 + x^20 - x^35 - x^46  + + - - .... Cf. A218171. [added Jan 21 2025: this is correct  - see Berndt et al., Theorem 3.2.] - Peter Bala, Feb 04 2021
From Peter Bala, Dec 12 2024 (Start)
The sequence terms occur as exponents in the expansion of F(x)*Product_{n >= 1} (1 - x^n) = Product_{n >= 1} (1 - x^n)*(1 + x^(4*n))^2*(1 + x^(4*n-2))*(1 + x^(8*n-3))*(1 + x^(8*n-5)) =  1 - x - x^6 + x^11 + x^13 - x^20 - x^35 + x^46 + x^50 - - + + ..., where F(x) is the g.f. of A069910.
It appears that the sequence terms occur as exponents in the expansion 1/(1 - x) * ( - x^2 + Sum_{n >= 1} x^floor((3*n+1)/2) * 1/Product_{k = 1..n} (1 + x^k) ) = x^6 + x^11 - x^13 - x^20 + x^35 + x^46 - - + + .... (End)
It appears that the sequence terms occur as exponents in the expansion Sum_{n >= 0} x^(n+1)/Product_{k = 1..2*n+2} (1 + x^k) =  x - x^6 - x^11 + x^13 + x^20 - x^35 - x^46  + + - - .... - Peter Bala, Jan 21 2025

			G.f. = x^2 + 6*x^3 + 11*x^4 + 13*x^5 + 20*x^6 + 35*x^7 + 46*x^8 + ...

G. C. Greubel, Table of n, a(n) for n = 1..1000
B. C. Berndt, B. Kim, and A. J. Yee, Ramanujan's lost notebook: Combinatorial proofs of identities associated with Heine's transformation or partial theta functions, J. Comb. Thy. Ser. A, 117 (2010), 957-973.
Mircea Merca, The bisectional pentagonal number theorem, Journal of Number Theory, Volume 157 (December 2015), Pages 223-232.
Index entries for linear recurrences with constant coefficients, signature (3,-5,7,-7,5,-3,1).

Cf. A000217, A001318, A069497, A074378, A057569, A057570, A154292, A193828, A218171.

/* By definition: */ [t/6: n in [0..160] | IsIntegral(t/6) where t is n*(n+1)/2]; // Bruno Berselli, Mar 07 2016

f:=n-> 8*(n-floor(n/4))+(-1)^n:seq((f(n)^2-1)/48,n=0..51); # Gary Detlefs, Mar 01 2010

lst={}; s=0; Do[s+=n/6; If[Floor[s]==s, AppendTo[lst, s]], {n, 0, 7!}]; lst (* Orlovsky *)
Join[{0}, Select[Table[Plus@@Range[n]/6, {n, 200}], IntegerQ]] (* Alonso del Arte, Jan 20 2012 *)
LinearRecurrence[{3,-5,7,-7,5,-3,1},{0,1,6,11,13,20,35},60] (* Charles R Greathouse IV, Jan 20 2012 *)
a[ n_] := (3 n^2 + If[ OddQ[ Quotient[ n + 1, 2]], -5 n + 2, -n]) / 4; (* Michael Somos, Feb 10 2015 *)
a[ n_] := Module[{m = n}, If[ n < 1, m = 1 - n]; SeriesCoefficient[ x^2 (1 + 4 x + x^2) (1 - x^2) (1 - x^6) / ((1 - x)^2 (1 - x^3) (1 - x^4)^2), {x, 0, m}]]; (* Michael Somos, Feb 10 2015 *)

a(n)=n--;(8*(n-n\4)+(-1)^n)^2\48 \\ Charles R Greathouse IV, Jan 02 2012

{a(n) = (3*n^2 + if( (n+1)\2%2, -5*n+2,-n)) / 4}; /* Michael Somos, Feb 10 2015 */

{a(n) = if( n<1, n = 1-n); polcoeff( x^2 * (1 + 4*x + x^2) * (1 - x^2) * (1 - x^6) / ((1 - x)^2 * (1 - x^3) * (1 - x^4)^2) + x * O(x^n), n)}; /* Michael Somos, Feb 10 2015 */

From R. J. Mathar, Jan 07 2009: (Start)
a(n) = A000217(A108752(n))/6.
G.f.: x^2*(x^2-x+1)*(x^2+4*x+1)/((1+x^2)^2*(1-x)^3) (conjectured). (End)
The conjectured g.f. is correct. - Charles R Greathouse IV, Jan 02 2012
a(n) = (f(n)^2-1)/48 where f(n) = 8*(n-floor(n/4))+(-1)^n, with offset 0, a(0)=0. - Gary Detlefs, Mar 01 2010
a(n) = a(1-n) for all n in Z. - Michael Somos, Oct 27 2012
G.f.: x^2 * (1 + 4*x + x^2) * (1 - x^2) * (1 - x^6) / ((1 - x)^2 * (1 - x^3) * (1 - x^4)^2). - Michael Somos, Feb 10 2015
Sum_{n>=2} 1/a(n) = 12 - (1+4/sqrt(3))*Pi. - Amiram Eldar, Mar 18 2022
a(n) = A069497(n)/6. - Hugo Pfoertner, Nov 19 2024
From Peter Bala, Jan 21 2025: (Start)
a(4*n) = 12*n^2 - n; a(4*n+1) = 12*n^2 + n;
a(4*n+2) = (3*n + 1)*(4*n + 1) = A033577(n); a(4*n+3) = (3*n + 2)*(4*n + 3) = A033578(n+1).
Let T(n) = n*(n + 1)/2 denote the n-th triangular number. Then
a(4*n) = (1/6) * T(12*n-1); a(4*n+1) = (1/6) * T(12*n);
a(4*n+2) = (1/6) * T(12*n+3); a(4*n+3) = (1/6) * T(12*n+8). (End)

Definition rewritten by M. F. Hasler, Dec 31 2012

A115671 Number of partitions of n into parts not congruent to 0, 2, 12, 14, 16, 18, 20, 30 (mod 32).

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 6, 8, 11, 15, 20, 26, 34, 44, 56, 72, 91, 114, 143, 178, 220, 272, 334, 408, 498, 605, 732, 884, 1064, 1276, 1528, 1824, 2171, 2580, 3058, 3616, 4269, 5028, 5910, 6936, 8124, 9498, 11088, 12922, 15034, 17468, 20264, 23472, 27154, 31369

Offset: 0

Michael Somos, Jan 29 2006

nonn

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Andrews (1987) refers to this sequence as p(S, n) where S is the set in equation (1) on page 437.

			G.f. = 1 + x + x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 6*x^6 + 8*x^7 + 11*x^8 + 15*x^9 + ...
a(5) = 4 since 5 = 4 + 1 = 3 + 1 + 1 = 1 + 1 + 1 + 1 + 1 in 4 ways.
a(6) = 6 since 6 = 5 + 1 = 4 + 1 + 1 = 3 + 3 = 3 + 1 + 1 + 1 = 1 + 1 + 1 + 1 + 1 + 1 in 6 ways.

G. C. Greubel, Table of n, a(n) for n = 0..1000 (terms 0..120 from Reinhard Zumkeller)
G. E. Andrews, q-series, CBMS Regional Conference Series in Mathematics, 66, Amer. Math. Soc. 1986, see p. 32. MR0858826 (88b:11063).
G. E. Andrews, Unsolved Problems: Further Problems on Partitions, Amer. Math. Monthly 94 (1987), no. 5, 437-439.
Mircea Merca, The bisectional pentagonal number theorem, Journal of Number Theory, Volume 157, December 2015, Pages 223-232.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A080054, A187154, A208851, A208856, A218171.

a115671 = p [x | x <- [0..], (mod x 32) `notElem` [0,2,12,14,16,18,20,30]]
   where p _          0 = 1
         p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- Reinhard Zumkeller, Mar 03 2012

a[ n_] := SeriesCoefficient[ (QPochhammer[ -q] / QPochhammer[ q] + 1) / 2, {q, 0, n}]; (* Michael Somos, Nov 09 2014 *)
a[ n_] := SeriesCoefficient[ (QPochhammer[ q^2]^3 / QPochhammer[ q]^2 / QPochhammer[ q^4] + 1) / 2, {q, 0, n}]; (* Michael Somos, Nov 09 2014 *)

{a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( (1 + eta(x^2 + A)^3 / (eta(x + A)^2 * eta(x^4 + A))) / 2, n))};

Expansion of (f(q) / f(-q) + 1) / 2 in powers of q where f() is a Ramanujan theta function.
Expansion of f(q^6, q^10) / f(-q, -q^3) = (f(q^22, q^26) - q^2 * f(q^10, q^38)) / f(-q, -q^2) in powers of x where f() is Ramanujan's two-variable theta function.
Euler transform of period 32 sequence [ 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, ...].
Given g.f. A(x), then B(x) = (2*A(x) - 1)^2 = g.f. A007096 satisfies 0 = f(B(x), B(x^2)) where f(u, v) = 1 + u^2 - 2 * u * v^2.
G.f. (1 + sqrt( theta_3(x) / theta_4(x))) / 2 = (Sum_{k} x^(8*k^2 - 2*k)) / (Sum_{k} (-x)^(2*k^2 - k)) = (Sum_{k} x^(24*n^2 + 2*n) - x^(24*n^2 + 14*n + 2)) / (Product_{k>0} 1 - x^k).
2 * a(n) = A080054(n) unless n = 0. a(2*n + 2) = A208851(n). a(2*n + 1) = A187154(n). a(n + 1) = A208856(n).

A346634 Number of strict odd-length integer partitions of 2n + 1.

Original entry on oeis.org

1, 1, 1, 2, 4, 6, 9, 14, 19, 27, 38, 52, 71, 96, 128, 170, 224, 293, 380, 491, 630, 805, 1024, 1295, 1632, 2048, 2560, 3189, 3958, 4896, 6038, 7424, 9100, 11125, 13565, 16496, 20013, 24223, 29250, 35244, 42378, 50849, 60896, 72789, 86841, 103424, 122960, 145937

Offset: 0

Gus Wiseman, Aug 01 2021

nonn

			The a(0) = 1 through a(7) = 14 partitions:
  (1)  (3)  (5)  (7)      (9)      (11)     (13)      (15)
                 (4,2,1)  (4,3,2)  (5,4,2)  (6,4,3)   (6,5,4)
                          (5,3,1)  (6,3,2)  (6,5,2)   (7,5,3)
                          (6,2,1)  (6,4,1)  (7,4,2)   (7,6,2)
                                   (7,3,1)  (7,5,1)   (8,4,3)
                                   (8,2,1)  (8,3,2)   (8,5,2)
                                            (8,4,1)   (8,6,1)
                                            (9,3,1)   (9,4,2)
                                            (10,2,1)  (9,5,1)
                                                      (10,3,2)
                                                      (10,4,1)
                                                      (11,3,1)
                                                      (12,2,1)
                                                      (5,4,3,2,1)

Alois P. Heinz, Table of n, a(n) for n = 0..2000

Odd bisection of A067659, which is ranked by A030059.
The even version is the even bisection of A067661.
The case of all odd parts is counted by A069911 (non-strict: A078408).
The non-strict version is A160786, ranked by A340931.
The non-strict even version is A236913, ranked by A340784.
The even-length version is A343942 (non-strict: A236914).
The even-sum version is A344650 (non-strict: A236559 or A344611).
A000009 counts partitions with all odd parts, ranked by A066208.
A000009 counts strict partitions, ranked by A005117.
A027193 counts odd-length partitions, ranked by A026424.
A027193 counts odd-maximum partitions, ranked by A244991.
A058695 counts partitions of odd numbers, ranked by A300063.
A340385 counts partitions with odd length and maximum, ranked by A340386.
Other cases of odd length:
- A024429 set partitions
- A089677 ordered set partitions
- A166444 compositions
- A174726 ordered factorizations
- A332304 strict compositions
- A339890 factorizations
Cf. A000700, A008289, A047993, A072233, A106529, A168659, A218171, A340102, A340604, A340607.

b:= proc(n, i, t) option remember; `if`(n>i*(i+1)/2, 0,
     `if`(n=0, t, add(b(n-i*j, i-1, abs(t-j)), j=0..min(n/i, 1))))
    end:
a:= n-> b(2*n+1$2, 0):
seq(a(n), n=0..80);  # Alois P. Heinz, Aug 05 2021

Table[Length[Select[IntegerPartitions[2n+1],UnsameQ@@#&&OddQ[Length[#]]&]],{n,0,15}]

More terms from Alois P. Heinz, Aug 05 2021

cp's OEIS Frontend

A154293 Integers of the form t/6, where t is a triangular number (A000217).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

Formula

Extensions

A115671 Number of partitions of n into parts not congruent to 0, 2, 12, 14, 16, 18, 20, 30 (mod 32).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A346634 Number of strict odd-length integer partitions of 2n + 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions