A058331 -id:A058331 - cp's OEIS frontend

A100314 Number of 2 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) and (01;1).

1, 4, 8, 14, 24, 42, 76, 142, 272, 530, 1044, 2070, 4120, 8218, 16412, 32798, 65568, 131106, 262180, 524326, 1048616, 2097194, 4194348, 8388654, 16777264, 33554482, 67108916, 134217782, 268435512, 536870970, 1073741884, 2147483710, 4294967360, 8589934658

Offset: 0

Sergey Kitaev, Nov 13 2004

An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1 < i2, j1 < j2 and these elements are in the same relative order as those in the triple (x,y,z). In general, the number of m X n 0-1 matrices in question is given by 2^m + 2^n + 2*(n*m-n-m).

Arthur H. Stroud, Approximate calculation of multiple integrals, Prentice-Hall, 1971.

Vincenzo Librandi, Table of n, a(n) for n = 0..2000
Ronald Cools, Encyclopaedia of Cubature Formulas
S. Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.
Index entries for linear recurrences with constant coefficients, signature (4,-5,2).

Cf. this sequence (m=2), A100315 (m=3), A100316 (m=4).
Cf. A000051, A000079, A001787, A002064, A005126, A005843.
Cf. A052548, A058331, A099003, A132750, A176691.
Row sums of A131830.

List([0..40],n->2^n+2*n); # Muniru A Asiru, Dec 21 2018

[2^n+2*n: n in [1..40]]; // Vincenzo Librandi, Oct 22 2011

a:= proc(n) 2^n + 2*n: end: seq(a(n),n=0..50); # Gary W. Adamson, Jul 20 2007

LinearRecurrence[{4,-5,2}, {1,4,8}, 34] (* Jean-François Alcover, Mar 19 2020 *)

makelist(2^n + 2*n, n, 0, 50); /* Franck Maminirina Ramaharo, Dec 19 2018 */

[2^n +2*n for n in range(41)] # G. C. Greubel, Feb 01 2023

a(n) = 2^n + 2*n.
From Gary W. Adamson, Jul 20 2007: (Start)
Binomial transform of (1, 3, 1, 1, 1, ...).
For n > 0, a(n) = 2*A005126(n-1). (End)
From R. J. Mathar, Jun 13 2008: (Start)
G.f.: 1 + 2*x*(2 -4*x +x^2)/((1-x)^2*(1-2*x)).
a(n+1)-a(n) = A052548(n). (End)
From Colin Barker, Oct 16 2013: (Start)
a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3).
G.f.: (1 - 3*x^2)/((1-x)^2*(1-2*x)). (End)
E.g.f.: exp(2*x) + 2*x*exp(x). - Franck Maminirina Ramaharo, Dec 19 2018
a(n) = A000079(n) + A005843(n). - Muniru A Asiru, Dec 21 2018

a(0)=1 prepended by Alois P. Heinz, Dec 21 2018

A247375 Numbers m such that floor(m/2) is a square.

Original entry on oeis.org

0, 1, 2, 3, 8, 9, 18, 19, 32, 33, 50, 51, 72, 73, 98, 99, 128, 129, 162, 163, 200, 201, 242, 243, 288, 289, 338, 339, 392, 393, 450, 451, 512, 513, 578, 579, 648, 649, 722, 723, 800, 801, 882, 883, 968, 969, 1058, 1059, 1152, 1153, 1250, 1251, 1352, 1353

Offset: 0

Bruno Berselli, Sep 15 2014

Union of A001105 and A058331.

Squares of the sequence are listed in A055792.

Jens Kruse Andersen, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A001105, A055792, A058331, A213037.

Cf. A130404 (numbers m such that floor(m/2) is a triangular number).

[n: n in [0..1400] | IsSquare(Floor(n div 2))];

Select[Range[0, 1400], IntegerQ[Sqrt[Floor[#/2]]] &]
LinearRecurrence[{1,2,-2,-1,1},{0,1,2,3,8},70] (* Harvey P. Dale, Oct 21 2021 *)

[n for n in [0..1400] if is_square(floor(n/2))]

G.f.: x*( 1 + x - x^2 + 3*x^3 ) / ( (1 - x)^3*(1 + x)^2 ).
a(n) = 1 + ( 2*n*(n-1) + (2*n-3)*(-1)^n - 1 )/4.
a(n+1) = 1 + A213037(n).
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5) for n >= 5. - Wesley Ivan Hurt, Dec 18 2020
Sum_{n>=1} 1/a(n) = Pi^2/12 + coth(Pi/sqrt(2))*Pi/(2*sqrt(2)) + 1/2. - Amiram Eldar, Sep 24 2022

A099597 Array T(n,k) read by antidiagonals: expansion of exp(x+y)/(1-xy).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 9, 4, 1, 1, 5, 19, 19, 5, 1, 1, 6, 33, 82, 33, 6, 1, 1, 7, 51, 229, 229, 51, 7, 1, 1, 8, 73, 496, 1313, 496, 73, 8, 1, 1, 9, 99, 919, 4581, 4581, 919, 99, 9, 1, 1, 10, 129, 1534, 11905, 32826, 11905, 1534, 129, 10, 1, 1, 11, 163, 2377, 25733, 137431, 137431, 25733, 2377, 163, 11, 1

Offset: 0

Ralf Stephan, Oct 28 2004

Rows are polynomials in n whose coefficients are in A099599.
From Peter Bala, Aug 19 2013: (Start)
The k-th superdiagonal sequence of this square array occurs as the sequence of numerators in the convergents to a certain continued fraction representation of the constant BesselI(k,2), where BesselI(k,x) is a modified Bessel function of the first kind:
Let d_k(n) = T(n,n+k) = n! * (n+k)! * Sum_{i=0..n} 1/(i!*(i+k)!) denote the sequence of entries on the k-th superdiagonal. It satisfies the first-order recurrence equation d_k(n) = n*(n+k)*d_k(n-1) + 1 with d_k(0) = 1 and also the second-order recurrence d_k(n) = (n*(n+k)+1)*d_k(n-1) - (n-1)*(n-1+k)*d_k(n-2) with initial conditions d_k(0) = 1 and d_k(1) = k+2. This latter recurrence is also satisfied by the sequence n!*(n+k)!. From this observation we obtain the finite continued fraction expansion d_k(n) = n!*(n+k)!*(1/(k! - k!/((k+2) - (k+1)/((2*k+5) - 2*(k+2)/((3*k+10) - ... - n*(n+k)/(((n+1)*(n+k+1)+1) ))))).
Taking the limit as n -> infinity produces a continued fraction representation for the modified Bessel function value BesselI(k,2) = Sum_{i=0..inf} 1/(i!*(i+k)!) = 1/(k! - k!/((k+2) -(k+1)/((2*k+5) - 2*(k+2)/((3*k+10) - ... - n*(n+k)/(((n+1)*(n+k+1)+1) - ...))))). See A070910 for the case k = 0 and A096789 for the case k = 1. (End)

			1, 1,  1,   1,    1,     1,
1, 2,  3,   4,    5,     6,
1, 3,  9,  19,   33,    51,
1, 4, 19,  82,  229,   496,
1, 5, 33, 229, 1313,  4581,
1, 6, 51, 496, 4581, 32826,

E. W. Weisstein, Modified Bessel Function of the First Kind

Rows include A000012, A000027, A058331. Main diagonal is A006040. Antidiagonal sums are in A099598. Cf. A099599.

Cf. A088699. A228229 (main super and subdiagonal).

#A099597
T := proc(n,k) option remember;
if n = 0 then 1 elif k = 0 then 1
else n*k*thisproc(n-1,k-1) + 1
fi
end:
# Diplay entries by antidiagonals
seq(seq(T(n-k,k), k = 0..n), n = 0..10);
# Peter Bala, Aug 19 2013

T[, 0] = T[0, ] = 1;
T[n_, k_] := T[n, k] = n k T[n - 1, k - 1] + 1;
Table[T[n - k, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 02 2019 *)

T(n,k) = Sum_{i=0..min(n,k)} C(n,i)*C(k,i)*i!^2. The LDU factorization of this square array is P * D * transpose(P), where P is Pascal's triangle A007318 and D = diag(0!^2, 1!^2, 2!^2, ... ). Compare with A088699. - Peter Bala, Nov 06 2007
Recurrence equation: T(n,k) = n*k*T(n-1,k-1) + 1 with boundary conditions T(n,0) = T(0,n ) = 1.
Main subdiagonal and main superdiagonal [1, 3, 19, 229, ...] is A228229. - Peter Bala, Aug 19 2013
nth row/column o.g.f.: HypergeometricPFQ[{1,1,-n},{},x/(x-1)]/(1-x) (see comment in A099599). - Natalia L. Skirrow, Jul 18 2025

A190404 Decimal expansion of (1/2)(1 + Sum_{k>=1} (1/2)^T(k)), where T=A000217 (triangular numbers); based on row 1 of the natural number array, A000027.

Original entry on oeis.org

8, 2, 0, 8, 1, 6, 2, 8, 0, 3, 2, 7, 5, 7, 6, 9, 3, 3, 1, 4, 6, 9, 2, 1, 3, 8, 5, 1, 1, 2, 7, 1, 4, 7, 1, 7, 1, 1, 3, 0, 3, 0, 7, 6, 8, 9, 7, 8, 3, 6, 9, 8, 7, 3, 9, 0, 2, 3, 2, 5, 8, 1, 1, 1, 9, 0, 0, 7, 2, 3, 0, 1, 8, 6, 6, 6, 7, 5, 8, 8, 7, 8, 0, 0, 1, 8, 2, 0, 8, 5, 8, 1, 1, 6, 7, 9, 5, 6, 6, 5, 4, 3, 0, 4, 4, 8, 6, 7, 6, 5, 8, 1, 7, 1, 8, 0, 9, 7, 3, 0

Offset: 0

Clark Kimberling, May 10 2011

Suppose that F={f(i,j): i>=1, j>=1} is an array of positive integers such that every positive integer occurs exactly once in F.
Let G=G(F) denote the array defined by g(i,j)=(1/2)^f(i,j);
R(i)=Sum_{j>=1} g(i,j); i-th row sum of G;
C(j)=Sum_{i>=1} g(i,j); j-th column sum of G;
U(j)=Sum_{i>=1} g(i,i+j-1); j-th upper diagonal sum of G;
L(i)=Sum_{j>=1} g(i+j,j); i-th lower diagonal sum of G;
R(odds)=Sum_{i>=1} R(2i-1); sum, odd numbered rows of G;
R(evens)=Sum_{i>=1} R(2i); sum, even numbered rows of G;
C(odds)=Sum_{j>=1} R(2j-1); sum, odd numbered cols of G;
C(evens)=Sum_{j>=1} R(2j); sum, even numbered cols of G;
UT=Sum_{j>=1} U(j); sum, upper triangular subarray of G;
LT=Sum_{i>=1} L(i); sum, lower triangular subarray of G.
...
Note that R(odds)+R(evens)=C(odds)+C(evens)=UT+LT=1.
...
For the natural number array F=A000027:
R(1)=0.820816280327576933146921385113... (A190404)
R(2)=0.160408140163788466573460692556...
R(3)=0.0177040700818942332867303462782...
R(4)=0.00103953504094711664336517313909...
R(5)=0.0000314862704735583216825865695447...
...
R(odds)=0.838551840434481240061632331355800... (A190408)
R(evens)=0.161448159565518759938367668644199...(A190409)
...
C(1)=0.64163256065515386629... (A190405)
C(2)=0.28326512131030773259...
C(3)=0.066530242620615465175...
C(4)=0.0080604852412309303507...
C(5)=0.00049597048246186070148...
...
C(odds)=0.7086590131172367153696485920526...(A190410)
C(evens)=0.29134098688276328463035140794... (A190411)
...
D(1)=0.53137210011527713548... (A190406)
D(2)=0.25391006493009715683...
D(3)=0.062744200230554270960...
D(4)=0.0078201298601943136650...
D(5)=0.00048840046110854191952...
...
E(1)=0.12695503246504857842... (A190407)
E(2)=0.015686050057638567740...
E(3)=0.00097751623252428920813...
E(4)=0.000030525028819283869970...
E(5)=0.00000047686626214460406264...
...
UT=0.8563503956097795739814618239914245448... (A190412)
LT=0.1436496043902204260185381760085754551... (A190415)

			0.820816280327576933146921385113...

Danny Rorabaugh, Table of n, a(n) for n = 0..10000

Cf. A190405-A190412, A190415, A299998.

f[i_, j_] := i + (j + i - 2)(j + i - 1)/2;
TableForm[Table[f[i,j],{i,1,10},{j,1,10}]] (* A000027 *)
r[i_] := Sum[2^-f[i, j], {j,1,400}];    (* C(row i) *)
c[j_] := Sum[2^-f[i,j], {i,1,400}];     (* C(col j) *)
d[h_] := Sum[2^-f[i,i+h-1], {i,1,200}]; (* C(udiag h) *)
e[h_] := Sum[2^-f[i+h,i], {i,1,200}];   (* C(ldiag h) *)
RealDigits[r[1], 10, 120, -1]  (* A190404 *)
N[r[1], 30]
N[r[2], 30]
N[r[3], 30]
N[r[4], 30]
N[r[5], 30]
N[r[6], 30]
RealDigits[c[1], 10, 120, -1] (* A190405 *)
N[c[1], 20]
N[c[2], 20]
N[c[3], 20]
N[c[4], 20]
N[c[5], 20]
N[c[6], 20]
RealDigits[d[1], 10, 20, -1] (* A190406 *)
N[d[1], 20]
N[d[2], 20]
N[d[3], 20]
N[d[4], 20]
N[d[5], 20]
N[d[6], 20]
RealDigits[e[1], 10, 20, -1] (* A190407 *)
N[e[1], 20]
N[e[2], 20]
N[e[3], 20]
N[e[4], 20]
N[e[5], 20]
N[e[6], 20]

def A190404(b):  # Generate the constant with b bits of precision
    return N(sum([(1/2)^(1+j*(j+1)/2) for j in range(1,b)])+1/2,b)
A190404(409) # Danny Rorabaugh, Mar 25 2015

A190404: (1/2)(1 + Sum_{k>=1} (1/2)^T(k)), where T=A000217 (triangular numbers).
A190405: Sum_{k>=1} (1/2)^T(k), where T=A000217.
A190406: Sum_{k>=1} (1/2)^S(k-1), where S=A001844 (centered square numbers).
A190407: Sum_{k>=1} (1/2)^V(k), where V=A058331 (1+2*k^2).
Equals Product_{k>=1} 1 - 1/(2^(2*k + 1) - 1). - Antonio Graciá Llorente, Oct 01 2024
Equals A299998/2. - Hugo Pfoertner, Oct 01 2024

A061317 Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...

Original entry on oeis.org

0, 3, 18, 57, 132, 255, 438, 693, 1032, 1467, 2010, 2673, 3468, 4407, 5502, 6765, 8208, 9843, 11682, 13737, 16020, 18543, 21318, 24357, 27672, 31275, 35178, 39393, 43932, 48807, 54030, 59613, 65568, 71907, 78642, 85785, 93348, 101343, 109782

Offset: 0

Henry Bottomley, Feb 13 2002

5*a(n+1) is the sum of the products of the 10 distinct combinations of three consecutive numbers starting with n (using 1,2,3 the 10 combinations are 111 112 113 122 123 133 222 223 233 333; 1*1*1 + 1*1*2 + 1*1*3 + 1*2*2 + 1*2*3 + 1*3*3 + 2*2*2 + 2*2*3 + 2*3*3 + 3*3*3 = 90 = 5*a(2)). - J. M. Bergot, Mar 28 2014 [expanded by Jon E. Schoenfield, Feb 22 2015]

			1+2 = 3; 3+4+5+6 = 18; 7+8+9+10+11+12 = 57; 13+14+15+16+17+18+19+20 = 132.

Harry J. Smith, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A005898, A006003.

Cf. A000217, A002378, A110450.

A061317:=n->2*n^3+n; seq(A061317(n), n=0..100); # Wesley Ivan Hurt, Mar 20 2014

Table[2n^3+n,{n,0,5!}] (* Vladimir Joseph Stephan Orlovsky, Dec 04 2010 *)
LinearRecurrence[{4,-6,4,-1},{0,3,18,57},40] (* Harvey P. Dale, Aug 23 2015 *)
With[{nn=40},Total/@TakeList[Range[nn+nn^2],2Range[0,nn]]] (* Requires Mathematica version 11 or later *) (* Harvey P. Dale, Mar 10 2018 *)

a(n) = { 2*n^3 + n } \\ Harry J. Smith, Jul 21 2009

a(n) = 2*n^3 + n.
a(n) = A000217(A002378(n)) - A000217(A002378(n-1)).
a(n) = 3 * A005900(n).
a(n) = A001477(n) * A058331(n).
a(n) = A000578(n) + A034262(n).
G.f.: 3*x*(1+x)^2/(x-1)^4.
a(n) = A110450(n) - A110450(n-1). - J.S. Seneschal, Jul 01 2025

A173130 a(n) = Cosh[(2 n - 1) ArcCosh[n]].

Original entry on oeis.org

0, 1, 26, 3363, 937444, 456335045, 343904160606, 371198523608647, 543466014742175624, 1036834190110356583689, 2499384905955651114739810, 7429238104512325157021090411, 26695718139185294187938997247212

Offset: 0

Artur Jasinski, Feb 10 2010

nonn

Cf. A058331, A001079, A037270, A071253, A108741, A132592, A146311, A146312, A146313, A173115, A173116, A173121, A173127, A173128.

Table[Round[Cosh[(2 n - 1) ArcCosh[n]]], {n, 0, 20}] (* Artur Jasinski *)

a(n) ~ 2^(2*n-2) * n^(2*n-1). - Vaclav Kotesovec, Apr 05 2016

A173131 a(n) = (Cosh[(2n-1)ArcSinh[n]])^2.

Original entry on oeis.org

1, 2, 1445, 19740250, 1361599599377, 298514762397852026, 160545187370375075046277, 179656719395983409634002348450, 373368546362937441101158606899394625

Offset: 0

Artur Jasinski, Feb 10 2010

nonn

Cf. A058331, A001079, A037270, A071253, A108741, A132592, A146311, A146312, A146313, A173115, A173116, A173121, A173127, A173128, A173129, A173130.

Table[Round[Cosh[(2 n - 1) ArcSinh[n]]^2], {n, 0, 10}] (* Artur Jasinski *)

a(n) ~ 2^(4*n-4) * n^(4*n-2). - Vaclav Kotesovec, Apr 05 2016

A080853 Square array of generalized polygonal numbers, read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 4, 9, 7, 1, 1, 5, 16, 19, 11, 1, 1, 6, 25, 37, 33, 16, 1, 1, 7, 36, 61, 67, 51, 22, 1, 1, 8, 49, 91, 113, 106, 73, 29, 1, 1, 9, 64, 127, 171, 181, 154, 99, 37, 1, 1, 10, 81, 169, 241, 276, 265, 211, 129, 46, 1, 1, 11, 100, 217, 323, 391, 406, 365, 277

Offset: 0

Paul Barry, Feb 23 2003

			Rows begin with n>=0, k>=0
1 1 1 1 1 ...
1 2 4 7 11 ...
1 3 9 19 33 ...
1 4 16 37 67 ...
1 5 25 61 113 ...

Rows include A000124, A058331, A080855, A080856, A080857, A080919.

Columns include A000290, A003215, A003215, A080859, A080860, A080861.

A080853 := proc(n,k)
    binomial(k,0)+n*binomial(k,1)+n^2*binomial(k,2) ;
end proc:
seq( seq(A080853(d-k,k),k=0..d),d=0..12) ; # R. J. Mathar, Oct 01 2021

T(n, k)=C(k, 0)+C(k, 1)n+C(k, 2)n^2=(n^2*k^2-(n^2-2n)*k+2)/2 =(k(k-1)*n^2+2k*n+2)/2
Row n has g.f. (1+(n-2)x+(n^2-n+1)x^2)/(1-x)^3.
Column k has g.f. (C(k-1, 0)+(C(k+1, 2)-2)*x+C(k-1, 2)*x^2)/(1-x)^3.
Diagonals are given by (n^4+(2k-1)*n^3+((k-1)^2+1)*n^2+(1-(k-1)^2)*n+2)/2.
Antidiagonal sums are 1, 2, 4, 9, 22, 53, 119,... = (d+1)*(2*d^4-7*d^3+27*d^2-22*d+120)/120 = sum_{k=0..d} T(d-k,k), first differences in  A116701, d>=0. - R. J. Mathar, Oct 01 2021

A097063 Expansion of (1-2x+3x^2)/((1+x)*(1-x)^3).

Original entry on oeis.org

1, 0, 3, 4, 9, 12, 19, 24, 33, 40, 51, 60, 73, 84, 99, 112, 129, 144, 163, 180, 201, 220, 243, 264, 289, 312, 339, 364, 393, 420, 451, 480, 513, 544, 579, 612, 649, 684, 723, 760, 801, 840, 883, 924, 969, 1012, 1059, 1104, 1153, 1200, 1251, 1300, 1353, 1404

Offset: 0

Paul Barry, Jul 22 2004

Partial sums of A097062. Pairwise sums are A002061. Binomial transform is essentially A007466.

Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

A diagonal of A326296.

A097063:=n->(1/4) + (3/4)*(-1)^n + (1/2)*n^2; seq(A097063(n), n=0..50); # Wesley Ivan Hurt, Mar 08 2014

Table[(1/4) + (3/4)*(-1)^n + (1/2)*n^2, {n, 0, 50}] (* Wesley Ivan Hurt, Mar 08 2014 *)

G.f. : (1-2*x+3*x^2)/((1-x^2)(1-x)^2).
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4).
a(n) = Sum_{k=0..n} (k^2-k+1)*(-1)^(n-k).
a(2n) = A058331(n); a(2n+1) = A046092(n). - R. J. Mathar, Oct 27 2008
a(n) = binomial(n+1, 2) - ceiling((n+1)/2) + 2((n+1) mod 2). - Wesley Ivan Hurt, Mar 08 2014
a(n) = 2*floor(n/2) + ceiling((n-1)^2/2). - M. Ryan Julian Jr., Sep 10 2019
a(n) = A326296(n + 1, n) for n > 0. - Andrew Howroyd, Sep 23 2019

A161856 Triangle read by rows in which row n lists the coefficients of the interpolating polynomial for its divisors of n.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 0, 2, 1, 6, 1, 1, 1, 1, 1, 2, 4, 1, 1, 2, 0, 1, 10, 1, 1, 0, 0, 1, 1, 1, 12, 1, 1, 4, -2, 1, 2, 0, 8, 1, 1, 1, 1, 1, 1, 16, 1, 1, 0, 2, -4, 12, 1, 18, 1, 1, 1, -2, 7, -11, 1, 2, 2, 8, 1, 1, 8, -6, 1, 22, 1, 1, 0, 0, 1, -3, 8, -12, 1, 4, 16, 1, 1, 10, -8, 1, 2, 4, 8, 1, 1

Offset: 1

Reinhard Zumkeller, Jun 20 2009

EDP(n,x) = SUM(a(A006218(n)-1+i)*A007318(x,i-1): 1<=i<=A000005(n)) is the interpolating polynomial for the divisors of n, see also A161700;
A000005(n) = length of n-th row, i.e. same length as n-th row in A027750;
sum of n-th row, n>1: A161857(n) = SUM(a(A006218(n-1)+i): 1<=i<=A000005(n));
a(A006218(n)+1) = 1.

			1; 1,1; 1,2; 1,1,1; 1,4; 1,1,0,2; 1,6; 1,1,1,1; 1,2,4; ... .

R. Zumkeller, Table of rows 1..1000, flattened
R. Zumkeller, Enumerations of Divisors

A005408, A000124, A016813, A086514, A000125, A058331, A002522, A161701, A161702, A161703, A000127, A161704, A161706, A161707, A161708, A161710, A080856, A161711, A161712, A161713, A006261, A161715.

cp's OEIS Frontend

A100314 Number of 2 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) and (01;1).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

Maxima

SageMath

Formula

Extensions

A247375 Numbers m such that floor(m/2) is a square.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Sage

Formula

A099597 Array T(n,k) read by antidiagonals: expansion of exp(x+y)/(1-xy).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A190404 Decimal expansion of (1/2)(1 + Sum_{k>=1} (1/2)^T(k)), where T=A000217 (triangular numbers); based on row 1 of the natural number array, A000027.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Sage

Formula

A061317 Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A173130 a(n) = Cosh[(2 n - 1) ArcCosh[n]].

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A173131 a(n) = (Cosh[(2n-1)ArcSinh[n]])^2.

Views

Author

Keywords

Crossrefs

A097063 Expansion of (1-2x+3x^2)/((1+x)*(1-x)^3).