A000629 -id:A000629 - cp's OEIS frontend

A195204 Triangle of coefficients of a sequence of binomial type polynomials.

2, 2, 4, 6, 12, 8, 26, 60, 48, 16, 150, 380, 360, 160, 32, 1082, 2940, 3120, 1680, 480, 64, 9366, 26908, 31080, 19040, 6720, 1344, 128, 94586, 284508, 351344, 236880, 96320, 24192, 3584, 256

Offset: 1

Peter Bala, Sep 13 2011

Define a polynomial sequence P_n(x) by means of the recursion
P_(n+1)(x) = x*(P_n(x)+ P_n(x+1)), with P_0(x) = 1.
The first few polynomials are
P_1(x) = 2*x, P_2(x) = 2*x*(2*x + 1),
P_3(x) = 2*x*(4*x^2 + 6*x + 3), P_4(x) = 2*x*(8*x^3+24*x^2+30*x+13).
The present table shows the coefficients of these polynomials (excluding P_0(x)) in ascending powers of x. The P_n(x) are a polynomial sequence of binomial type. In particular, if we denote P_n(x) by x^[n] then we have the analog of the binomial expansion
(x+y)^[n] = Sum_{k = 0..n} binomial(n,k)*x^[n-k]*y^[k].
There are further analogies between the x^[n] and the monomials x^n.
1) Dobinski-type formula
exp(-x)*Sum_{k >= 0} (-k)^[n]*x^k/k! = (-1)^n*Bell(n,2*x),
where the Bell (or exponential) polynomials are defined as
Bell(n,x) := Sum_{k = 1..n} Stirling2(n,k)*x^k.
Equivalently, the connection constants associated with the polynomial sequences {x^[n]} and {x^n} are (up to signs) the same as the connection constants associated with the polynomial sequences {Bell(n,2*x)} and {Bell(n,x)}. For example, the list of coefficients of x^[4] is [26,60,48,16] and a calculation gives
Bell(4,2*x) = -26*Bell(1,x) + 60*Bell(2,x) - 48*Bell(3,x) + 16*Bell(4,x).
2) Analog of Bernoulli's summation formula
Bernoulli's formula for the sum of the p-th powers of the first n positive integers is
Sum_{k = 1..n} k^p = (1/(p+1))*Sum_{k = 0..p} (-1)^k * binomial(p+1,k)*B_k*n^(p+1-k), where B_k = [1,-1/2,1/6,0,-1/30,...] is the sequence of Bernoulli numbers.
This generalizes to
2*Sum_{k = 1..n} k^[p] = 1/(p+1)*Sum_{k = 0..p} (-1)^k * binomial(p+1,k)*B_k*n^[p+1-k].
The polynomials P_n(x) belong to a family of polynomial sequences P_n(x,t) of binomial type, dependent on a parameter t, and defined recursively by P_(n+1)(x,t)= x*(P_n(x,t)+ t*P_n(x+1,t)), with P_0(x,t) = 1. When t = 0 we have P_n(x,0) = x^n, the monomial polynomials. The present table is the case t = 1. The case t = -2 is (up to signs) A079641. See also A195205 (case t = 2).
Triangle T(n,k) (1 <= k <= n), read by rows, given by (0, 1, 2, 2, 4, 3, 6, 4, 8, 5, 10, ...) DELTA (2, 0, 2, 0, 2, 0, 2, 0, 2, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Dec 22 2011
T(n,k) is the number of binary relations R on [n] with index = 1 containing exactly k strongly connected components (SCC's) and satisfying the condition that if (x,y) is in R then x and y are in the same SCC. - Geoffrey Critzer, Jan 17 2024

			Triangle begins
n\k|....1......2......3......4......5......6......7
===================================================
..1|....2
..2|....2......4
..3|....6.....12......8
..4|...26.....60.....48.....16
..5|..150....380....360....160.....32
..6|.1082...2940...3120...1680....480.....64
..7|.9366..26908..31080..19040...6720...1344....128
...
Relation with rising factorials for row 4:
x^[4] = 16*x^4+48*x^3+60*x^2+26*x = 2^4*x*(x+1)*(x+2)*(x+3)-6*2^3*x*(x+1)*(x+2)+7*2^2*x*(x+1)-2*x, where [1,7,6,1] is the fourth row of the triangle of Stirling numbers of the second kind A008277.
Generalized Dobinski formula for row 4:
exp(-x)*Sum_{k >= 1} (-k)^[4]*x^k/k! = exp(-x)*Sum_{k >= 1} (16*k^4-48*k^3+60*k^2-26*k)*x^k/k! = 16*x^4+48*x^3+28*x^2+2*x = Bell(4,2*x).
Example of generalized Bernoulli summation formula:
2*(1^[2]+2^[2]+...+n^[2]) = 1/3*(B_0*n^[3]-3*B_1*n^[2]+3*B_2*n^[1]) =
n*(n+1)*(4*n+5)/3, where B_0 = 1, B_1 = -1/2, B_2 = 1/6 are Bernoulli numbers.
From _Philippe Deléham_, Dec 22 2011: (Start)
Triangle (0, 1, 2, 2, 4, 3, 6, ...) DELTA (2, 0, 2, 0, 2, ...) begins:
  1;
  0,    2;
  0,    2,     4;
  0,    6,    12,     8;
  0,   26,    60,    48,    16;
  0,  150,   380,   360,   160,   32;
  0, 1082,  2940,  3120,  1680,  480,   64;
  0, 9366, 26908, 31080, 19040, 6720, 1344, 128;
  ... (End)

Cf. A000629 (row sums), A000670 (one half row sums), A014307 (row polys. at x = 1/2), A079641, A195205, A209849.

# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> (-1)^(n+1)*polylog(-n, 2), 10); # Peter Luschny, Jan 29 2016

BellMatrix[f_Function, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
rows = 12;
M = BellMatrix[(-1)^(#+1) PolyLog[-#, 2]&, rows];
Table[M[[n, k]], {n, 2, rows}, {k, 2, n}] // Flatten (* Jean-François Alcover, Jun 24 2018, after Peter Luschny *)

E.g.f.: F(x,z) := (exp(z)/(2-exp(z)))^x = Sum_{n>=0} P_n(x)*z^n/n!
= 1 + 2*x*z + (2*x+4*x^2)*z^2/2! + (6*x+12*x^2+8*x^3)*z^3/3! + ....
The generating function F(x,z) satisfies the partial differential equation d/dz(F(x,z)) = x*F(x,z) + x*F(x+1,z) and hence the row polynomials P_n(x) satisfy the recurrence relation
P_(n+1)(x)= x*(P_n(x) + P_n(x+1)), with P_0(x) = 1.
In what follows we change notation and write x^[n] for P_n(x).
Relation with the factorial polynomials:
For n >= 1,
x^[n] = Sum_{k = 1..n} (-1)^(n-k)*Stirling2(n,k)*2^k*x^(k),
and its inverse formula
2^n*x^(n) = Sum_{k = 1..n} |Stirling1(n,k)|*x^[k],
where x^(n) denotes the rising factorial x*(x+1)*...*(x+n-1).
Relation with the Bell polynomials:
The alternating n-th row entries (-1)^(n+k)*T(n,k) are the connection coefficients expressing the polynomial Bell(n,2*x) as a linear combination of Bell(k,x), 1 <= k <= n.
The delta operator:
The sequence of row polynomials is of binomial type. If D denotes the derivative operator d/dx then the delta operator D* for this sequence of binomial type polynomials is given by
D* = D/2 - log(cosh(D/2)) = log(2*exp(D)/(exp(D)+1))
= (D/2) - (D/2)^2/2! + 2*(D/2)^4/4! - 16*(D/2)^6/6! + 272*(D/2)^8/8! - ...,
where [1,2,16,272,...] is the sequence of tangent numbers A000182.
D* is the lowering operator for the row polynomials
(D*)x^[n] = n*x^[n-1].
Associated Bernoulli polynomials:
Generalized Bernoulli polynomial GB(n,x) associated with the polynomials x^[n] may be defined by
GB(n,x) := ((D*)/(exp(D)-1))x^[n].
They satisfy the difference equation
GB(n,x+1) - GB(n,x) = n*x^[n-1]
and have the expansion
GB(n,x) = -(1/2)*n*x^[n-1] + (1/2)*Sum_{k = 0..n} binomial(n,k) * B_k * x^[n-k], where B_k denotes the ordinary Bernoulli numbers.
The first few polynomials are
GB(0,x) = 1/2, GB(1,x) = x-3/4, GB(2,x) = 2*x^2-2*x+1/12,
GB(3,x) = 4*x^3-3*x^2-x, GB(4,x) = 8*x^4-4*x^2-4*x-1/60.
It can be shown that
1/(n+1)*(d/dx)(GB(n+1,x)) = Sum_{i = 0..n} 1/(i+1) * Sum_{k = 0..i} (-1)^k *binomial(i,k)*(x+k)^[n].
This generalizes a well-known formula for Bernoulli polynomials.
Relations with other sequences:
Row sums: A000629(n) = 2*A000670(n). Column 1: 2*A000670(n-1). Row polynomials evaluated at x = 1/2: {P_n(1/2)}n>=0 = [1,1,2,7,35,226,...] = A014307.
T(n,k) = A184962(n,k)*2^k. - Philippe Deléham, Feb 17 2013
Also the Bell transform of A076726. For the definition of the Bell transform see A264428. - Peter Luschny, Jan 29 2016
Conjecture: o.g.f. as a continued fraction of Stieltjes type: 1/(1 - 2*x*z/(1 - z/(1 - 2*(x + 1)*z/(1 - 2*z/(1 - 2*(x + 2)*z/(1 - 3*z/(1 - 2*(x + 3)*z/(1 - 4*z/(1 - ... ))))))))). - Peter Bala, Dec 12 2024

a(1) added by Philippe Deléham, Dec 22 2011

A299906 Array read by antidiagonals: T(n,k) = number of n X k lonesum decomposable (0,1) matrices.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 8, 16, 8, 1, 1, 16, 58, 58, 16, 1, 1, 32, 196, 344, 196, 32, 1, 1, 64, 634, 1786, 1786, 634, 64, 1, 1, 128, 1996, 8528, 13528, 8528, 1996, 128, 1, 1, 256, 6178, 38578, 90946, 90946, 38578, 6178, 256, 1, 1, 512, 18916, 168344, 564376, 833432, 564376, 168344, 18916, 512, 1

Offset: 0

N. J. A. Sloane, Feb 23 2018

A (0,1) n X k matrix is lonesum if the matrix is uniquely determined by its row-sum and column-sum vectors, that is, by the sum of its rows and the sum of its columns. For example, the 2 X 3 matrix [1,1,1 / 0,1,0] is the only matrix with column-sum vector [1,2,1] and row-sum vector [3,1].

			Array begins:
  1,  1,   1,    1,     1,      1, ...,
  1,  2,   4,    8,    16,     32, ...,
  1,  4,  16,   58,   196,    634, ...,
  1,  8,  58,  344,  1786,   8528, ...,
  1, 16, 196, 1786, 13528,  90946, ...,
  1, 32, 634, 8528, 90446, 833432, ...,
  ...

Ken Kamano, Lonesum decomposable matrices, arXiv:1701.07157 [math.CO], 2017. Also Discrete Math., 341 (2018), 341-349.

Cf. A299904, A299905.
See A299907 for main diagonal (i.e. square matrices).
See also A000629, A221961 for symmetric square matrices.
See A099594 for lonesum (0,1) matrices.

T[n_, k_] := Sum[(Binomial[j-1, k0-1] * j!^2 * StirlingS2[k+1, j+1] * StirlingS2[n+1, j+1])/k0!, {k0, 0, k}, {j, k0, Min[k, n]}]; Table[T[n-k, k], {n, 0, 10}, {k, 0, n}] // Flatten (* Jean-François Alcover, Feb 24 2018 *)

More terms from Jean-François Alcover, Feb 24 2018

Name corrected by Alexander Karpov, Oct 19 2019

A305988 Expansion of e.g.f. 1/(1 + log(2 - exp(x))).

Original entry on oeis.org

1, 1, 4, 24, 194, 1970, 24062, 343294, 5601122, 102847794, 2098766582, 47117285270, 1154031484586, 30622256174458, 875092190716382, 26794239236959806, 875110094707912562, 30367988674208286914, 1115822099409002188358, 43276913813553367194598, 1766830322476935945014330

Offset: 0

Ilya Gutkovskiy, Jun 15 2018

nonn

Stirling transform of A007840.

			1/(1 + log(2 - exp(x))) = 1 + x + 4*x^2/2! + 24*x^3/3! + 194*x^4/4! + 1970*x^5/5! + 24062*x^6/6! + ...

Robert Israel, Table of n, a(n) for n = 0..402
N. J. A. Sloane, Transforms
Eric Weisstein's World of Mathematics, Stirling Transform

Cf. A000629, A000670, A007840, A050351, A083355, A305323.

b:= proc(n) b(n):= n!*`if`(n=0, 1, add(b(k)/(k!*(n-k)), k=0..n-1)) end:
a:= n-> add(Stirling2(n, j)*b(j$2), j=0..n):
seq(a(n), n=0..25);  # Alois P. Heinz, Jun 15 2018

nmax = 20; CoefficientList[Series[1/(1 + Log[2 - Exp[x]]), {x, 0, nmax}], x] Range[0, nmax]!
Table[Sum[Sum[StirlingS2[n, k] Abs[StirlingS1[k, j]] j!, {j, 0, k}], {k, 0, n}], {n, 0, 20}]

a(n) = Sum_{k=0..n} Stirling2(n,k)*A007840(k).

a(n) ~ n! / ((2*exp(1) - 1) * (log(2 - exp(-1)))^(n+1)). - Vaclav Kotesovec, Jul 01 2018

A344490 a(n) = 1 + Sum_{k=0..n-3} binomial(n-2,k) * a(k).

Original entry on oeis.org

1, 1, 1, 2, 4, 8, 20, 57, 171, 548, 1894, 6998, 27368, 112653, 486645, 2201162, 10397944, 51161168, 261571460, 1386846249, 7612315023, 43190917004, 252951090586, 1527112817054, 9492126182336, 60677428545165, 398489257136529, 2686088269505042, 18567557376240748

Offset: 0

Ilya Gutkovskiy, May 21 2021

nonn

Cf. A000629, A210540, A344489, A344491, A344492, A344493.

a[n_] := a[n] = 1 + Sum[Binomial[n - 2, k] a[k] , {k, 0, n - 3}]; Table[a[n], {n, 0, 28}]
nmax = 28; A[] = 0; Do[A[x] = (1 + x^2 A[x/(1 - x)])/((1 - x) (1 + x^2)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

G.f. A(x) satisfies: A(x) = (1 + x^2 * A(x/(1 - x))) / ((1 - x) * (1 + x^2)).

A344491 a(n) = 1 + Sum_{k=0..n-4} binomial(n-3,k) * a(k).

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 8, 16, 37, 97, 275, 810, 2468, 7840, 26182, 92047, 339029, 1299185, 5152244, 21091816, 89087652, 388318264, 1746324563, 8094422821, 38608318847, 189179752492, 950930369320, 4898477508796, 25841317224002, 139534769647745, 770795537345237, 4353368099507329

Offset: 0

Ilya Gutkovskiy, May 21 2021

nonn

Cf. A000629, A210541, A344489, A344490, A344492, A344493.

a[n_] := a[n] = 1 + Sum[Binomial[n - 3, k] a[k] , {k, 0, n - 4}]; Table[a[n], {n, 0, 31}]
nmax = 31; A[] = 0; Do[A[x] = (1 + x^3 A[x/(1 - x)])/((1 - x) (1 + x^3)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

G.f. A(x) satisfies: A(x) = (1 + x^3 * A(x/(1 - x))) / ((1 - x) * (1 + x^3)).

A344492 a(n) = 1 + Sum_{k=0..n-5} binomial(n-4,k) * a(k).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 70, 170, 452, 1277, 3731, 11145, 34031, 106888, 348016, 1180538, 4173726, 15320402, 58053312, 225891952, 899492200, 3660479037, 15228099789, 64831944993, 282763031581, 1263953233142, 5788015999020, 27121892020940, 129849269955372, 634208223729772

Offset: 0

Ilya Gutkovskiy, May 21 2021

nonn

Cf. A000629, A210542, A344489, A344490, A344491, A344493.

a[n_] := a[n] = 1 + Sum[Binomial[n - 4, k] a[k] , {k, 0, n - 5}]; Table[a[n], {n, 0, 33}]
nmax = 33; A[] = 0; Do[A[x] = (1 + x^4 A[x/(1 - x)])/((1 - x) (1 + x^4)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

G.f. A(x) satisfies: A(x) = (1 + x^4 * A(x/(1 - x))) / ((1 - x) * (1 + x^4)).

A344493 a(n) = 1 + Sum_{k=0..n-6} binomial(n-5,k) * a(k).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 135, 308, 767, 2059, 5821, 16963, 50312, 151189, 460981, 1433634, 4578748, 15110212, 51704075, 183423444, 672385222, 2534056116, 9768179743, 38357842713, 153070136072, 620275332697, 2553688944713, 10696223834397, 45654239302087

Offset: 0

Ilya Gutkovskiy, May 21 2021

nonn

Cf. A000629, A210543, A344489, A344490, A344491, A344492.

a[n_] := a[n] = 1 + Sum[Binomial[n - 5, k] a[k] , {k, 0, n - 6}]; Table[a[n], {n, 0, 34}]
nmax = 34; A[] = 0; Do[A[x] = (1 + x^5 A[x/(1 - x)])/((1 - x) (1 + x^5)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

G.f. A(x) satisfies: A(x) = (1 + x^5 * A(x/(1 - x))) / ((1 - x) * (1 + x^5)).

A371293 Numbers whose binary indices have (1) prime indices covering an initial interval and (2) squarefree product.

Original entry on oeis.org

1, 2, 3, 6, 7, 22, 23, 32, 33, 48, 49, 86, 87, 112, 113, 516, 517, 580, 581, 1110, 1111, 1136, 1137, 1604, 1605, 5206, 5207, 5232, 5233, 5700, 5701, 8212, 8213, 9236, 9237, 13332, 13333, 16386, 16387, 16450, 16451, 17474, 17475, 21570, 21571, 24576, 24577

Offset: 1

Gus Wiseman, Mar 28 2024

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

			The terms together with their prime indices of binary indices begin:
    1: {{}}
    2: {{1}}
    3: {{},{1}}
    6: {{1},{2}}
    7: {{},{1},{2}}
   22: {{1},{2},{3}}
   23: {{},{1},{2},{3}}
   32: {{1,2}}
   33: {{},{1,2}}
   48: {{3},{1,2}}
   49: {{},{3},{1,2}}
   86: {{1},{2},{3},{4}}
   87: {{},{1},{2},{3},{4}}
  112: {{3},{1,2},{4}}
  113: {{},{3},{1,2},{4}}
  516: {{2},{1,3}}
  517: {{},{2},{1,3}}
  580: {{2},{4},{1,3}}
  581: {{},{2},{4},{1,3}}

Without the covering condition we have A371289.
Without squarefree product we have A371292.
Interchanging binary and prime indices gives A371448.
A000009 counts partitions covering initial interval, compositions A107429.
A000670 counts ordered set partitions, allowing empty sets A000629.
A005117 lists squarefree numbers.
A011782 counts multisets covering an initial interval.
A048793 lists binary indices, A000120 length, A272020 reverse, A029931 sum.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
A131689 counts patterns by number of distinct parts.
A302521 lists MM-numbers of set partitions, with empties A302505.
A326701 lists BII-numbers of set partitions.
A368533 lists numbers with squarefree binary indices, prime indices A302478.
Cf. A000040, A001222, A255906, A326782, A371291, A371294, A371447, A371452.

normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[1000],SquareFreeQ[Times @@ bpe[#]]&&normQ[Join@@prix/@bpe[#]]&]

Intersection of A371292 and A371289.

A032109 "BIJ" (reversible, indistinct, labeled) transform of 1,1,1,1,...

Original entry on oeis.org

1, 1, 2, 7, 38, 271, 2342, 23647, 272918, 3543631, 51123782, 811316287, 14045783798, 263429174191, 5320671485222, 115141595488927, 2657827340990678, 65185383514567951, 1692767331628422662, 46400793659664205567, 1338843898122192101558, 40562412499252036940911

Offset: 0

Christian G. Bower

nonn

Starting (1, 2, 7, 38, 271, ...) = A008292 * [1, 1, 2, 4, 8, ...]. - Gary W. Adamson, Dec 25 2008
The inverse binomial transform is 1, 0, 1, 3, 19, 135, 1171, 11823, 136459, ..., see A091346. - R. J. Mathar, Oct 17 2012
Stirling transform of A001710. - Anton Zakharov, Aug 06 2016
For n even (resp. n odd), a(n) counts the ordered partitions of {1,2,...,n} with an even (resp. odd) number of blocks, and a(n)-1 counts the ordered partitions of {1,2,...,n} with an odd (resp. even) number of blocks. - Jose A. Rodriguez, Feb 04 2021

Alois P. Heinz, Table of n, a(n) for n = 0..424 (first 101 terms from R. J. Mathar)
C. G. Bower, Transforms (2)

A000629, A000670, A002050, A032109, A052856, A076726 are all more-or-less the same sequence. - N. J. A. Sloane, Jul 04 2012
A052856(n)=2*a(n), if n>0.
Cf. A008292, A001710.

A032109 := proc(n)
    (A000670(n)+1)/2 ;
end proc: # R. J. Mathar, Oct 17 2012
a := n -> (polylog(-n, 1/2)+`if`(n=0,3,2))/4:
seq(round(evalf(a(n), 32)), n=0..18); # Peter Luschny, Nov 03 2015
# alternative Maple program:
b:= proc(n, m) option remember; `if`(n=0, m!,
      add(b(n-1, max(m, j)), j=1..m+1))
    end:
a:= n-> (b(n,0)+1)/2:
seq(a(n), n=0..23);  # Alois P. Heinz, Sep 29 2017

Table[(PolyLog[-n, 1/2] + 2 + KroneckerDelta[n])/4, {n, 0, 20}] (* Vladimir Reshetnikov, Nov 02 2015 *)

a(n)=if(n<0,0,n!*polcoeff(subst((1-y^2/2)/(1-y),y,exp(x+x*O(x^n))-1),n))

list(n)=my(v=Vec(subst((1-y^2/2)/(1-y),y,exp(x+x*O(x^n))-1)));vector(n+1,i,v[i]*(i-1)!) \\ Charles R Greathouse IV, Oct 17 2012

E.g.f.: (e^(2*x)-2*e^x-1)/(2*e^x-4).
a(n) = (A000670(n)+1)/2. - Vladeta Jovovic, Apr 13 2003
a(n) = A052875(n)/2 + 1. - Max Alekseyev, Jan 31 2021
a(n) ~ sqrt(Pi/2)*n^(n+1/2)/(2*log(2)^(n+1)*exp(n)). - Ilya Gutkovskiy, Aug 06 2016
a(n) = Sum_{s in S_n^even} Product_{i=1..n} binomial(i,s(i)-1), where s ranges over the set S_n^even of even permutations of [n]. - Jose A. Rodriguez, Feb 02 2021

A032183 "CIJ" (necklace, indistinct, labeled) transform of 3,3,3,3...

Original entry on oeis.org

3, 12, 84, 876, 12180, 211692, 4415124, 107430636, 2987482260, 93461994732, 3248794543764, 124223034396396, 5181679901192340, 234153759187726572, 11395053576644512404, 594148263021558162156

Offset: 1

Christian G. Bower

nonn

Christian G. Bower, Transforms (2)
Index entries for sequences related to necklaces

Cf. A000629, A027882.

Table[ PolyLog[n, 3/4], {n, 0, -15, -1}] (* Robert G. Wilson v, Aug 05 2010 *)

a(n)=polylog(1-n,3/4) \\ Charles R Greathouse IV, Aug 27 2014

From Vladeta Jovovic, Sep 14 2003: (Start)
E.g.f.: -log(4-3*exp(x)).
a(n) = Sum_{k=1..n} 3^k*(k-1)!*Stirling2(n, k). (End)
a(n) ~ (n-1)! / (log(4/3))^n. - Vaclav Kotesovec, Mar 29 2014
a(n) = 3 * (1 + Sum_{k=1..n-1} binomial(n-1,k-1) * a(k)). - Ilya Gutkovskiy, Aug 09 2020

cp's OEIS Frontend

A195204 Triangle of coefficients of a sequence of binomial type polynomials.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A299906 Array read by antidiagonals: T(n,k) = number of n X k lonesum decomposable (0,1) matrices.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A305988 Expansion of e.g.f. 1/(1 + log(2 - exp(x))).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A344490 a(n) = 1 + Sum_{k=0..n-3} binomial(n-2,k) * a(k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A344491 a(n) = 1 + Sum_{k=0..n-4} binomial(n-3,k) * a(k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A344492 a(n) = 1 + Sum_{k=0..n-5} binomial(n-4,k) * a(k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A344493 a(n) = 1 + Sum_{k=0..n-6} binomial(n-5,k) * a(k).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A371293 Numbers whose binary indices have (1) prime indices covering an initial interval and (2) squarefree product.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A032109 "BIJ" (reversible, indistinct, labeled) transform of 1,1,1,1,...

Views