Herman P. Robinson - cp's OEIS frontend

User: Herman P. Robinson

Herman P. Robinson has authored 14 sequences. Here are the ten most recent ones:

A005484 Numerators of continued fraction convergents to cube root of 7.

1, 2, 21, 44, 725, 1494, 2219, 10370, 22959, 33329, 722868, 756197, 2991459, 15713492, 18704951, 53123394, 71828345, 124951739, 321731823, 3664001792, 18641740783, 22305742575, 85558968508, 107864711083, 301288390674, 8242651259281, 33271893427798, 41514544687079

Offset: 0

N. J. A. Sloane, Herman P. Robinson

D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 67.
P. Seeling, Verwandlung der irrationalen Groesse ... in einen Kettenbruch, Archiv. Math. Phys., 46 (1866), 80-120.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..999

Cf. A005482, A005483, A005485 (denominators).

Numerator[Convergents[7^(1/3), 40]] (* Vincenzo Librandi, Sep 08 2013 *)

a(n)= contfracpnqn(contfrac(7^(1/3), n))[1, 1]; \\ Michel Marcus, Sep 07 2013

More terms from Michel Marcus, Sep 07 2013
Inserted a(27) by Vincenzo Librandi, Sep 08 2013
Offset changed by Andrew Howroyd, Jul 05 2024

A003116 Expansion of the reciprocal of the g.f. defining A039924.

Original entry on oeis.org

1, 1, 2, 4, 7, 13, 23, 41, 72, 127, 222, 388, 677, 1179, 2052, 3569, 6203, 10778, 18722, 32513, 56455, 98017, 170161, 295389, 512755, 890043, 1544907, 2681554, 4654417, 8078679, 14022089, 24337897, 42242732, 73319574, 127258596, 220878683

Offset: 0

N. J. A. Sloane, Herman P. Robinson

Conjecture: a(n) is the number of compositions p(1) + p(2) + ... + p(m) = n with p(i)-p(i-1) <= 1, see example; cf. A034297. - Vladeta Jovovic, Feb 09 2004
Row sums and central terms of the triangle in A168396: a(n) = A168396(2*n+1,n) and for n > 0: a(n) = Sum_{k=1..n} A168396(n,k). - Reinhard Zumkeller, Sep 13 2013
Former definition was "Expansion of reciprocal of a determinant." - N. J. A. Sloane, Aug 10 2018
From Doron Zeilberger, Aug 10 2018: (Start)
Jovovic's conjecture can be proved as follows. There is a sign-changing involution defined on pairs (L1,L2) where L1 is a partition with difference >= 2 between consecutive parts and L2 is the number of compositions described by Jovovic, with the sign (-1)^(Number of parts of L1).
Let a be the largest part of L1 and b the largest part of L2. If b-a>=2 then move b from L2 to the top of L1, otherwise move a to the top of L2.
Since this is an involution and it changes the sign (the number of parts of L1 changes parity) this proves it, since the g.f. of A039924 is exactly the signed-enumeration of the set given by L1. (End)

			From _Joerg Arndt_, Dec 29 2012: (Start)
There are a(6)=23 compositions p(1)+p(2)+...+p(m)=6 such that p(k)-p(k-1) <= 1:
[ 1]  [ 1 1 1 1 1 1 ]
[ 2]  [ 1 1 1 1 2 ]
[ 3]  [ 1 1 1 2 1 ]
[ 4]  [ 1 1 2 1 1 ]
[ 5]  [ 1 1 2 2 ]
[ 6]  [ 1 2 1 1 1 ]
[ 7]  [ 1 2 1 2 ]
[ 8]  [ 1 2 2 1 ]
[ 9]  [ 1 2 3 ]
[10]  [ 2 1 1 1 1 ]
[11]  [ 2 1 1 2 ]
[12]  [ 2 1 2 1 ]
[13]  [ 2 2 1 1 ]
[14]  [ 2 2 2 ]
[15]  [ 2 3 1 ]
[16]  [ 3 1 1 1 ]
[17]  [ 3 1 2 ]
[18]  [ 3 2 1 ]
[19]  [ 3 3 ]
[20]  [ 4 1 1 ]
[21]  [ 4 2 ]
[22]  [ 5 1 ]
[23]  [ 6 ]
Replacing the condition with p(k)-p(k-1) <= 0 gives integer partitions.
(End)

D. H. Lehmer, Combinatorial and cyclotomic properties of certain tridiagonal matrices. Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1974), pp. 53-74. Congressus Numerantium, No. X, Utilitas Math., Winnipeg, Man., 1974. MR0441852.
H. P. Robinson, Letter to N. J. A. Sloane, Nov 19 1973.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..4176 (first 401 terms from T. D. Noe)
Roland Bacher, Generic numerical semigroups, hal-03221466 [math.CO], 2021.
George Beck and Shane Chern, Reciprocity between partitions and compositions, arXiv:2108.04363 [math.CO], 2021.
Shalosh B. Ekhad and Doron Zeilberger, D.H. Lehmer's Tridiagonal determinant: An Etude in (Andrews-Inspired) Experimental Mathematics, arXiv:1808.06730 [math.CO], 2018.
Miguel Mendez, Shift-plethysm, Hydra continued fractions, and m-distinct partitions, arXiv:2009.04623 [math.CO], 2020.
Herman P. Robinson, Letter to N. J. A. Sloane, Nov 13 1973.
Herman P. Robinson, Letter to N. J. A. Sloane, Nov 19 1973.

Cf. A003114, A039924, A034297, A168443, A224959.

a003116 n = a168396 (2 * n + 1) n  -- Reinhard Zumkeller, Sep 13 2013

max = 35; f[x_] := 1/Sum[x^k^2*((-1)^k/Product[1 - x^i, {i, 1, k}]), {k, 0, Floor[Sqrt[max]]}]; CoefficientList[ Series[f[x], {x, 0, max}], x](* Jean-François Alcover, Jun 12 2012, after PARI *)
b[n_, k_] := b[n, k] = Expand[If[n == 0, 1, x*
     Sum[b[n - j, j], {j, 1, Min[n, k + 1]}]]];
a[n_] := Total@CoefficientList[b[n, n], x];
Table[a[n], {n, 0, 35}] (* Jean-François Alcover, Apr 14 2022, after Alois P. Heinz in A168443 *)

a(n)=if(n<0,0,polcoeff(1/sum(k=0,sqrtint(n),x^k^2/prod(i=1,k,x^i-1,1+x*O(x^n))),n))

G.f.: 1/(Sum_{k>=0} x^(k^2)(-1)^k/(Product_{i=1..k} 1-x^i)).

a(n) ~ c * d^n, where d = 1/A347901 = 1.73566282453034742565826074971966853... and c = 0.9180565304926754125870866477349969555868577236908640010903420353... - Vaclav Kotesovec, Nov 01 2021

Definition revised by N. J. A. Sloane, Aug 10 2018 at the suggestion of Doron Zeilberger

A003113 Coefficients in expansion of permanent of infinite tridiagonal matrix shown below.

Original entry on oeis.org

2, 1, 2, 2, 3, 3, 5, 5, 7, 8, 10, 11, 15, 16, 20, 23, 28, 31, 38, 42, 51, 57, 67, 75, 89, 99, 115, 129, 149, 166, 192, 213, 244, 272, 309, 344, 391, 433, 489, 543, 611, 676, 760, 839, 939, 1038, 1157, 1276, 1422, 1565, 1738, 1913, 2119, 2328, 2576, 2826, 3120

Offset: 0

N. J. A. Sloane, Herman P. Robinson

nonn

1 0 0 0 0 0 ...
1 x 0 0 0 0 0 ...
x 1 x^2 0 0 0 ...
0 x^2 1 x^3 0 0 ...
0 0 x^3 1 x^4 0 0 0 ...
...................

D. H. Lehmer, Course on History of Mathematics, Univ. Calif. Berkeley, 1973.
H. P. Robinson, Letter to N. J. A. Sloane, Jan 04 1974.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
Herman P. Robinson, Letter to N. J. A. Sloane, Jan 1974.

Cf. A119469, A003114, A003106.

The generalized Rogers-Ramanujan series G[1], G[2], G[3], G[4], G[5], G[6], G[7], G[8] are A003114, A003106, A006141, A264591, A264592, A264593, A264594, A264595. The present sequence, which is G[1]+G[2], plays the role of G[0].

nmax = 60; CoefficientList[1 + Series[Sum[x^(j*(j-1))/Product[1 - x^i, {i, 1, j}], {j, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jan 02 2016 *)

G.f.: 1 + sum(i>=1, x^(i*(i-1))/prod(j=1..i, 1-x^j)) - Jon Perry, Jul 04 2004
a(n) = A003114(n)+A003106(n). So this is the sum of the two famous Rogers-Ramanujan series. - Vladeta Jovovic, Jul 17 2004
G.f.: sum(n>=0,(q^(n^2)*(1+q^n)) / prod(k=1..n,1-q^k)). [Joerg Arndt, Oct 08 2012]
a(n) ~ (9+4*sqrt(5))^(1/4) * exp(2*Pi*sqrt(n/15)) / (2*3^(1/4)*sqrt(5)*n^(3/4)). - Vaclav Kotesovec, Jan 02 2016

More terms from Vladeta Jovovic, Aug 30 2001

A003107 Number of partitions of n into Fibonacci parts (with a single type of 1).

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 8, 10, 14, 17, 22, 27, 33, 41, 49, 59, 71, 83, 99, 115, 134, 157, 180, 208, 239, 272, 312, 353, 400, 453, 509, 573, 642, 717, 803, 892, 993, 1102, 1219, 1350, 1489, 1640, 1808, 1983, 2178, 2386, 2609, 2854, 3113, 3393, 3697, 4017, 4367, 4737

Offset: 0

N. J. A. Sloane, Herman P. Robinson

The partitions allow repeated items but the order of items is immaterial (1+2=2+1). - Ron Knott, Oct 22 2003

A098641(n) = a(A000045(n)). - Reinhard Zumkeller, Apr 24 2005

			a(4) = 4 since the 4 partitions of 4 using only Fibonacci numbers, repetitions allowed, are 1+1+1+1, 2+2, 2+1+1, 3+1.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 (first 1000 terms from T. D. Noe)
G. Almkvist, Partitions with Parts in a Finite Set and with Parts Outside a Finite Set, Exper. Math. vol 11 no 4 (2002) p 449-456.
Igor Pak, Complexity problems in enumerative combinatorics, arXiv:1803.06636 [math.CO], 2018.
Herman P. Robinson, Letter to N. J. A. Sloane, Jan 1974.

Cf. A007000, A005092, A028290 (where the only Fibonacci numbers allowed are 1, 2, 3, 5 and 8).
Cf. A000045, A000119, A102848, A238998.
Row sums of A319394.

import Data.MemoCombinators (memo2, integral)
a003107 n = a003107_list !! n
a003107_list = map (p' 2) [0..] where
   p' = memo2 integral integral p
   p _ 0 = 1
   p k m | m < fib   = 0
         | otherwise = p' k (m - fib) + p' (k + 1) m where fib = a000045 k
-- Reinhard Zumkeller, Dec 09 2015

F:= combinat[fibonacci]:
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<2, 0,
       b(n, i-1)+`if`(F(i)>n, 0, b(n-F(i), i))))
    end:
a:= proc(n) local j; for j from ilog[(1+sqrt(5))/2](n+1)
       while F(j+1)<=n do od; b(n, j)
    end:
seq(a(n), n=0..100);  # Alois P. Heinz, Jul 11 2013

CoefficientList[ Series[1/ Product[1 - x^Fibonacci[i], {i, 2, 21}], {x, 0, 53}], x] (* Robert G. Wilson v, Mar 28 2006 *)
nmax = 53;
s = Table[Fibonacci[n], {n, nmax}];
Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 0, nmax}] (* Robert Price, Jul 31 2020 *)
F = Fibonacci;
b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 2, 0,
     b[n, i - 1] + If[F[i] > n, 0, b[n - F[i], i]]]];
a[n_] := Module[{j}, For[j = Floor@Log[(1+Sqrt[5])/2, n+1],
     F[j + 1] <= n, j++]; b[n, j]];
a /@ Range[0, 100] (* Jean-François Alcover, May 21 2021, after Alois P. Heinz *)

f(x,y,z)=if(xCharles R Greathouse IV, Dec 14 2015

a(n) = (1/n)*Sum_{k=1..n} A005092(k)*a(n-k), n > 1, a(0)=1. - Vladeta Jovovic, Jan 21 2002
G.f.: Product_{i>=2} 1/(1-x^fibonacci(i)). - Ron Knott, Oct 22 2003
a(n) = f(n,1,1) with f(x,y,z) = if xReinhard Zumkeller, Nov 11 2009
G.f.: 1 + Sum_{i>=2} x^Fibonacci(i) / Product_{j=2..i} (1 - x^Fibonacci(j)). - Ilya Gutkovskiy, May 07 2017

More terms from Vladeta Jovovic, Jan 21 2002

A002355 Denominators of convergents to cube root of 4.

Original entry on oeis.org

1, 1, 2, 5, 12, 17, 63, 143, 492, 635, 2397, 3032, 93357, 96389, 478913, 575302, 1629517, 15240955, 93075247, 387541943, 480617190, 868159133, 2216935456, 16386707325, 34990350106, 121357757643, 277705865392, 399063623035, 2672087603602, 3071151226637

Offset: 0

N. J. A. Sloane, Herman P. Robinson

D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 67.
P. Seeling, Verwandlung der irrationalen Groesse ... in einen Kettenbruch, Archiv. Math. Phys., 46 (1866), 80-120.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..999

Cf. A002356 (numerators), A005480.

Denominator[Convergents[Power[4, (3)^-1], 30]] (* Vincenzo Librandi, Aug 24 2013 *)

a(n) = contfracpnqn(contfrac(4^(1/3), n))[2, 1]; \\ Michel Marcus, Aug 23 2013

More terms from Vincenzo Librandi, Aug 24 2013

Offset changed by Andrew Howroyd, Jul 04 2024

A002358 Numerators of convergents to cube root of 5.

Original entry on oeis.org

1, 2, 5, 12, 53, 171, 566, 737, 4251, 4988, 9239, 41944, 428679, 7329487, 7758166, 115943811, 123701977, 239645788, 731522646953, 731762292741, 1463284939694, 2195047232435, 3658332172129, 5853379404564, 9511711576693, 24876802557950, 59265316692593

Offset: 0

N. J. A. Sloane, Herman P. Robinson

D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 67.
P. Seeling, Verwandlung der irrationalen Groesse ... in einen Kettenbruch, Archiv. Math. Phys., 46 (1866), 80-120.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..999

Cf. A002357 (denominators), A005481.

Numerator[Convergents[5^(1/3), 30]] (* Vincenzo Librandi, Sep 08 2013 *)

a(n)= contfracpnqn(contfrac(5^(1/3), n))[1, 1]; \\ Michel Marcus, Sep 07 2013

More terms from Vincenzo Librandi, Sep 08 2013

A002360 Numerators of continued fraction convergents to cube root of 6.

Original entry on oeis.org

1, 2, 9, 20, 149, 467, 237385, 237852, 1426645, 7371077, 8797722, 16168799, 24966521, 66101841, 91068362, 157170203, 3863153234, 4020323437, 7883476671, 11903800108, 43594876995, 142688431093, 4324247809785, 17439679670233, 178721044512115, 28255364712584403

Offset: 0

N. J. A. Sloane, Herman P. Robinson

D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 67.
P. Seeling, Verwandlung der irrationalen Groesse ... in einen Kettenbruch, Archiv. Math. Phys., 46 (1866), 80-120.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harvey P. Dale, Table of n, a(n) for n = 0..999

Cf. A002359 (denominators), A002949, A005486.

Numerator[Convergents[Power[6, (3)^-1],30]] (* Harvey P. Dale, Oct 16 2011 *)

a(n) = contfracpnqn(contfrac(6^(1/3), n))[1, 1]; \\ Michel Marcus, Aug 23 2013

Definition clarified by, and more terms from, Harvey P. Dale, Oct 16 2011

Offset changed by Andrew Howroyd, Jul 05 2024

A002950 Continued fraction for fifth root of 2.

Original entry on oeis.org

1, 6, 1, 2, 1, 1, 1, 3, 25, 1, 4, 3, 3, 7, 52, 1, 2, 3, 2, 15, 2, 2, 4, 16, 2, 7, 1, 1, 1, 10, 21, 1, 1, 1, 141, 2, 4, 1, 4, 2, 1, 1, 17, 1, 3, 3, 4, 1, 3, 1, 3, 2, 1, 1, 2, 33, 1, 6, 6, 1, 2, 4, 1, 21, 1, 3, 3, 8, 10, 1, 46, 6, 1, 10, 1, 1, 1, 1, 2, 11, 1, 3, 1

Offset: 0

N. J. A. Sloane, Herman P. Robinson

			2^(1/5) = 1.148698354997035006798626946... = 1 + 1/(6 + 1/(1 + 1/(2 + 1/(1 + ...)))). - _Harry J. Smith_, May 12 2009

H. P. Robinson, Letter to N. J. A. Sloane, Nov 13 1973.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harry J. Smith, Table of n, a(n) for n = 0..19999
Herman P. Robinson, Letter to N. J. A. Sloane, Nov 13 1973.
J. Shallit & N. J. A. Sloane, Correspondence 1974-1975
G. Xiao, Contfrac
Index entries for continued fractions for constants

Cf. A005531 (decimal expansion).

Cf. A002361, A002362 (convergents).

SetDefaultRealField(RealField(100)); ContinuedFraction(2^(1/5)); // G. C. Greubel, Nov 02 2018

with(numtheory):
cfrac(2^(1/5),100,'quotients'); # Muniru A Asiru, Nov 02 2018

ContinuedFraction[2^(1/5), 100] (* G. C. Greubel, Nov 02 2018 *)

{ allocatemem(932245000); default(realprecision, 21000); x=contfrac(2^(1/5)); for (n=1, 20000, write("b002950.txt", n-1, " ", x[n])); } \\ Harry J. Smith, May 12 2009

Offset changed by Andrew Howroyd, Jul 05 2024

A002364 Numerators of continued fraction convergents to fifth root of 5.

Original entry on oeis.org

1, 3, 4, 7, 11, 29, 40, 109, 912, 1021, 26437, 27458, 163727, 191185, 4369797, 4560982, 40857653, 45418635, 86276288, 821905227, 908181515, 1730086742, 7828528483, 9558615225, 26945758933, 36504374158, 99954507249, 136458881407, 372872270063, 882203421533

Offset: 0

N. J. A. Sloane, Herman P. Robinson

D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 67.
P. Seeling, Verwandlung der irrationalen Groesse ... in einen Kettenbruch, Archiv. Math. Phys., 46 (1866), 80-120.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]

Cf. A002363 (denominators), A002951 A005534.

Numerator[Convergents[Surd[5,5],30]] (* Harvey P. Dale, Dec 06 2015 *)

Definition clarified by and more terms from Harvey P. Dale, Dec 06 2015

Offset changed by Andrew Howroyd, Jul 05 2024

A003106 Number of partitions of n into parts 5k+2 or 5k+3.

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 6, 6, 8, 9, 11, 12, 15, 16, 20, 22, 26, 29, 35, 38, 45, 50, 58, 64, 75, 82, 95, 105, 120, 133, 152, 167, 190, 210, 237, 261, 295, 324, 364, 401, 448, 493, 551, 604, 673, 739, 820, 899, 997, 1091, 1207, 1321, 1457, 1593, 1756, 1916, 2108, 2301

Offset: 0

N. J. A. Sloane, Herman P. Robinson

Expansion of Rogers-Ramanujan function H(x) in powers of x.
Also number of partitions of n such that the number of parts is greater by one than the smallest part. - Vladeta Jovovic, Mar 04 2006
Example: a(10)=4 because we have [9, 1], [6, 2, 2], [5, 3, 2] and [4, 4, 2]. - Emeric Deutsch, Apr 09 2006
Also number of partitions of n such that if the largest part is k, then there are exactly k-1 parts equal to k. Example: a(10)=4 because we have [3, 3, 2, 2], [3, 3, 2, 1, 1], [3, 3, 1, 1, 1, 1] and [2, 1, 1, 1, 1, 1, 1, 1, 1]. - Emeric Deutsch, Apr 09 2006
Also number of partitions of n such that if the largest part is k, then k occurs at least k+1 times. Example: a(10)=4 because we have [2, 2, 2, 2, 2], [2, 2, 2, 2, 1, 1], [2, 2, 2, 1, 1, 1, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. - Emeric Deutsch, Apr 09 2006
Also number of partitions of n such that the smallest part is larger than the number of parts. Example: a(10)=4 because we have [10], [7, 3], [6, 4] and [5, 5]. - Emeric Deutsch, Apr 09 2006
Also number of partitions into distinct parts where parts differ by at least 2 and with minimal part >= 2, a(0)=1 because the condition is void for the empty list. - Joerg Arndt, Jan 04 2011
The g.f. is the special case D=2 of Sum_{n>=0} x^(D*n*(n+1)/2) / Product_{k=1..n} (1-x^k), the g.f. or partitions into distinct parts where the difference between successive parts is >= D and the minimal part >= D. - Joerg Arndt, Mar 31 2014
For more about the generalized Rogers-Ramanujan series G[i](x) see the Andrews-Baxter and Lepowsky-Zhu papers. The present series is G[2](x). - N. J. A. Sloane, Nov 22 2015
Convolution of A109699 and A109698. - Vaclav Kotesovec, Jan 21 2017

			G.f. = 1 + x^2 + x^3 + x^4 + x^5 + 2*x^6 + 2*x^7 + 3*x^8 + 3*x^9 + 4*x^10 + 4*x^11 + ...
G.f. = q^11 + q^131 + q^191 + q^251 + q^311 + 2*q^371 + 2*q^431 + 3*q^491 + 3*q^551 + ...
From _Joerg Arndt_, Dec 27 2012: (Start)
The a(18)=15: the partitions of 18 where all parts are 2 or 3 (mod 5) are
[ 1]  [ 2 2 2 2 2 2 2 2 2 ]
[ 2]  [ 3 3 2 2 2 2 2 2 ]
[ 3]  [ 3 3 3 3 2 2 2 ]
[ 4]  [ 3 3 3 3 3 3 ]
[ 5]  [ 7 3 2 2 2 2 ]
[ 6]  [ 7 3 3 3 2 ]
[ 7]  [ 7 7 2 2 ]
[ 8]  [ 8 2 2 2 2 2 ]
[ 9]  [ 8 3 3 2 2 ]
[10]  [ 8 7 3 ]
[11]  [ 8 8 2 ]
[12]  [ 12 2 2 2 ]
[13]  [ 12 3 3 ]
[14]  [ 13 3 2 ]
[15]  [ 18 ]
(End)
From _Wolfdieter Lang_, Oct 29 2016: (Start)
The a(18)=15 partitions of 18 without part 1 and parts differing by at least 2 are:
  [18]; [16,2], [15,3], [14,4], [13,5], [12,6], [11,7], [10,8]; [12,4,2], [11,5,2], [10,6,2], [9,7,2],[10,5,3], [9,6,3], [8,6,4]. The semicolon separates different number of parts. The maximal number of parts is A259361(18) = 3. (End)

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 238.
G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press, 1999; Exercise 6(f), p. 591.
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 669.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 108.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 5th ed., Clarendon Press, Oxford, 2003, pp. 290-291.
H. P. Robinson, Letter to N. J. A. Sloane, Jan 04 1974.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe)
G. E. Andrews, Euler's "De Partitio Numerorum", Bull. Amer. Math. Soc., 44 (No. 4, 2007), 561-573.
George E. Andrews; R. J. Baxter, A motivated proof of the Rogers-Ramanujan identities, Amer. Math. Monthly 96 (1989), no. 5, 401-409.
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712.
P. Jacob and P. Mathieu, Parafermionic derivation of Andrews-type multiple-sums, arXiv:hep-th/0505097, 2005.
James Lepowsky and Minxian Zhu, A motivated proof of Gordon's identities, arXiv:1205.6570 [math.CO], 2012; The Ramanujan Journal 29.1-3 (2012): 199-211.
I. Martinjak, D. Svrtan, New Identities for the Polarized Partitions and Partitions with d-Distant Parts, J. Int. Seq. 17 (2014) # 14.11.4.
Herman P. Robinson, Letter to N. J. A. Sloane, Jan 1974.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
Eric Weisstein's World of Mathematics, Rogers-Ramanujan Identities

Cf. A003114.
Cf. A047221, A219607.
For the generalized Rogers-Ramanujan series G[1], G[2], G[3], G[4], G[5], G[6], G[7], G[8] see A003114, A003106, A006141, A264591, A264592, A264593, A264594, A264595. G[0] = G[1]+G[2] is given by A003113.

a003106 = p a047221_list where
   p _          0 = 1
   p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- Reinhard Zumkeller, Nov 30 2012

g:=1/product((1-x^(5*j-2))*(1-x^(5*j-3)),j=1..15): gser:=series(g,x=0,66): seq(coeff(gser,x,n),n=0..63); # Emeric Deutsch, Apr 09 2006

max = 63; g[x_] := 1/Product[(1-x^(5j-2))*(1-x^(5j-3)), {j, 1, Floor[max/4]}]; CoefficientList[ Series[g[x], {x, 0, max}], x] (* Jean-François Alcover, Nov 17 2011, after Emeric Deutsch *)
Table[Count[IntegerPartitions[n], p_ /; Min[p] > Length[p]], {n, 40}] (* Clark Kimberling, Feb 13 2014 *)
a[ n_] := SeriesCoefficient[ 1 / (QPochhammer[ x^2, x^5] QPochhammer[ x^3, x^5]), {x, 0, n}]; (* Michael Somos, May 06 2015 *)
a[ n_] := SeriesCoefficient[ Product[ (1 - x^k)^{0, -1, -1, 0, 0}[[Mod[k, 5, 1]]], {k, n}], {x, 0, n}]; (* Michael Somos, May 17 2015 *)
nmax = 63; kmax = nmax/5;
s = Flatten[{Range[0, kmax]*5 + 2}~Join~{Range[0, kmax]*5 + 3}];
Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 0, nmax}] (* Robert Price, Jul 31 2020 *)

{a(n) = my(t); if( n<0, 0, t = 1 + x * O(x^n); polcoeff( sum(k=1, (sqrtint(4*n + 1) - 1) \ 2, t *= x^(2*k) / (1 - x^k) * (1 + x * O(x^(n - k^2 - k))), 1), n))}; /* Michael Somos, Oct 15 2008 */

The Rogers-Ramanujan identity is 1 + Sum_{n >= 1} t^(n*(n+1))/((1-t)*(1-t^2)*...*(1-t^n)) = Product_{n >= 1} 1/((1-t^(5*n-2))*(1-t^(5*n-3))); this is the g.f. for the sequence.
G.f.: (Product_{k>0} 1 + x^(2*k)) * (Sum_{k>=0} x^(k^2 + 2*k) / (Product_{i=1..k} 1 - x^(4*i))). - Michael Somos, Oct 19 2006
Euler transform of period 5 sequence [ 0, 1, 1, 0, 0, ...]. - Michael Somos, Oct 15 2008
From Joerg Arndt, Oct 10 2012: (Start)
Bill Gosper gives (message to the math-fun mailing list, Oct 07 2012)
prod(k>=0, [0 , a;  q^k, 1]) = [0, X(a,q);  0, Y(a,q)] where
X(a,q) = a * sum(n>=0, a^n*q^(n^2) / prod(k=1..n, 1-q^n) ) and
Y(a,q) = sum(n>=0, a^n*q^(n^2-n) / prod(k=1..n, 1-q^n) ).
Set a=q to obtain prod(k>=0, [0 , a;  q^k, 1]) = [0, q*H(q);  0, G(q)] where
H(q) is the g.f. of A003106 and G(q) is the g.f. of A003114.
Bill Gosper and N. J. A. Sloane give (message to math-fun, Oct 10 2012)
prod(k>=0, [0 , a*q^k;  1, 1]) = [U(a,q), U(a,q);  V(a,q), V(a,q)] where
U(a,q) = a * sum(n>=0, a^n*q^(n^2+n) / prod(k=1..n, 1-q^k) ) and
V(a,q) = sum(n>=0, a^n*q^(n^2) / prod(k=1..n, 1-q^k) ).
Set a=1 to obtain prod(k>=0, [0 , q^k;  1, 1]) = [H(q), H(q);  G(q), G(q)].
(End)
Expansion of f(-x^5) / f(-x^2, -x^3) in powers of x where f(, ) is the Ramanujan general theta function. - Michael Somos, May 06 2015
Expansion of f(-x, -x^4) / f(-x) in powers of x where f(, ) is the Ramanujan general theta function. - Michael Somos, Jun 13 2015
a(n) ~ sqrt((sqrt(5)-1)/5) * exp(2*Pi*sqrt(n/15)) / (2^(3/2) * 3^(1/4) * n^(3/4)) * (1 + (11*Pi/(60*sqrt(15)) - 3*sqrt(15)/(16*Pi)) / sqrt(n)). - Vaclav Kotesovec, Aug 24 2015, extended Jan 24 2017
a(n) = (1/n)*Sum_{k=1..n} A284152(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 21 2017

cp's OEIS Frontend

User: Herman P. Robinson

A005484 Numerators of continued fraction convergents to cube root of 7.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A003116 Expansion of the reciprocal of the g.f. defining A039924.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A003113 Coefficients in expansion of permanent of infinite tridiagonal matrix shown below.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A003107 Number of partitions of n into Fibonacci parts (with a single type of 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A002355 Denominators of convergents to cube root of 4.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A002358 Numerators of convergents to cube root of 5.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A002360 Numerators of continued fraction convergents to cube root of 6.

Views