Sequences
392,541 sequences
- Number of unitary divisors of n (A034444) < number of non-unitary divisors of n (A048105).A048111
Number of unitary divisors of n (A034444) < number of non-unitary divisors of n (A048105).
- a(1) = 1, a(2) = 1, a(3) = 1, a(n) = a(n-3) * (a(n-2) + a(n-1)).A048112
a(1) = 1, a(2) = 1, a(3) = 1, a(n) = a(n-3) * (a(n-2) + a(n-1)).
- Triangular array T read by rows: T(h,k) = number of paths consisting of steps from (1,1) to (h,k) such that each step has length 1 directed up or right and each vertex (i,j) satisfies i/2<=j<=2i, for h=0,1,2,... and k=0,1,2,...A048113
Triangular array T read by rows: T(h,k) = number of paths consisting of steps from (1,1) to (h,k) such that each step has length 1 directed up or right and each vertex (i,j) satisfies i/2<=j<=2i, for h=0,1,2,... and k=0,1,2,...
- a(n) = Sum{T(n,i): i=0,1,...,n}, where T is given by A048113.A048114
a(n) = Sum{T(n,i): i=0,1,...,n}, where T is given by A048113.
- (1/2)*Sum{T(n,i): i=0,1,...,n}, where T is given by A048113.A048115
(1/2)*Sum{T(n,i): i=0,1,...,n}, where T is given by A048113.
- a(n) = T(2n,n), where T is given by A048113.A048116
a(n) = T(2n,n), where T is given by A048113.
- a(n)=(1/2)*T(2n,n), where T is given by A048113.A048117
a(n)=(1/2)*T(2n,n), where T is given by A048113.
- a(n)=T(2n+1,n+1), where T is given by A048113.A048118
a(n)=T(2n+1,n+1), where T is given by A048113.
- a(n)=(1/2)*T(2n+1,n+1), where T is given by A048113.A048119
a(n)=(1/2)*T(2n+1,n+1), where T is given by A048113.
- a(n)=T(2n,n+1), where T is given by A048113.A048120
a(n)=T(2n,n+1), where T is given by A048113.
- a(n) = (1/2)*T(2n,n+1), where T is given by A048113.A048121
a(n) = (1/2)*T(2n,n+1), where T is given by A048113.
- a(1) = 1, a(2) = 2, a(n) = a(n-1)^3 - a(n-2)^3.A048122
a(1) = 1, a(2) = 2, a(n) = a(n-1)^3 - a(n-2)^3.
- Smallest n-digit Carmichael numbers.A048123
Smallest n-digit Carmichael numbers.
- Becomes prime or 4 after exactly 2 iterations of f(x) = sum of prime factors of x.A048124
Becomes prime or 4 after exactly 2 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 3 iterations of f(x) = sum of prime factors of x.A048125
Becomes prime or 4 after exactly 3 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 4 iterations of f(x) = sum of prime factors of x.A048126
Becomes prime or 4 after exactly 4 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 5 iterations of f(x) = sum of prime factors of x.A048127
Becomes prime or 4 after exactly 5 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 6 iterations of f(x) = sum of prime factors of x.A048128
Becomes prime or 4 after exactly 6 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 7 iterations of f(x) = sum of prime factors of x.A048129
Becomes prime or 4 after exactly 7 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.A048130
Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.A048131
Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.
- Becomes prime or 4 after exactly 10 iterations of f(x) = sum of prime factors of x.A048132
Becomes prime or 4 after exactly 10 iterations of f(x) = sum of prime factors of x.
- Least number which becomes prime or 4 after exactly n iterations of f(x) = sum of prime factors of x.A048133
Least number which becomes prime or 4 after exactly n iterations of f(x) = sum of prime factors of x.
- Number of colors that can be mixed with up to n units of yellow, blue, red.A048134
Number of colors that can be mixed with up to n units of yellow, blue, red.
- Tomahawk-constructible n-gons.A048135
Tomahawk-constructible n-gons.
- Tomahawk-nonconstructible n-gons.A048136
Tomahawk-nonconstructible n-gons.
- Erroneous version of A005806.A048137
Erroneous version of A005806.
- a(n) = number of m such that sum of proper divisors of m (A001065(m)) is n.A048138
a(n) = number of m such that sum of proper divisors of m (A001065(m)) is n.
- Number of planar partitions of n, when partitions that are rotations of each other (when regarded as 3-D objects) are counted only once.A048139
Number of planar partitions of n, when partitions that are rotations of each other (when regarded as 3-D objects) are counted only once.
- Number of planar partitions of n, but partitions that are mirror images of each other (when regarded as 3-D objects) are counted only once.A048140
Number of planar partitions of n, but partitions that are mirror images of each other (when regarded as 3-D objects) are counted only once.
- Number of symmetrical planar partitions of n: planar partitions (A000219) that when regarded as 3-D objects have a threefold axis of symmetry that is the intersection of 3 mirror planes, i.e., C3v symmetry.A048141
Number of symmetrical planar partitions of n: planar partitions (A000219) that when regarded as 3-D objects have a threefold axis of symmetry that is the intersection of 3 mirror planes, i.e., C3v symmetry.
- Number of symmetrical planar partitions of n: planar partitions (A000219) that when regarded as 3-D objects have only a threefold axis of symmetry, i.e., C3 symmetry.A048142
Number of symmetrical planar partitions of n: planar partitions (A000219) that when regarded as 3-D objects have only a threefold axis of symmetry, i.e., C3 symmetry.
- Number of labeled connected simplicial complexes with n nodes.A048143
Number of labeled connected simplicial complexes with n nodes.
- a(n) = Sum_{k=0..n} (k!)^2 * Stirling_2(n,k)^2.A048144
a(n) = Sum_{k=0..n} (k!)^2 * Stirling_2(n,k)^2.
- Fourier coefficients of T_{22}.A048145
Fourier coefficients of T_{22}.
- Sum of non-unitary divisors of n.A048146
Sum of non-unitary divisors of n.
- Array T read by diagonals; T(i,j) = i^2 + j^2.A048147
Array T read by diagonals; T(i,j) = i^2 + j^2.
- Distinct elements of A045948.A048148
Distinct elements of A045948.
- Array T read by diagonals: T(i,j) = number of pairs (h,k) with h^2+k^2 <= i^2+j^2, h>=0, k >= 0.A048149
Array T read by diagonals: T(i,j) = number of pairs (h,k) with h^2+k^2 <= i^2+j^2, h>=0, k >= 0.
- a(n)=number of numbers h^2+k^2 that are <=2n^2; equivalently, a(n)=T(n,n), array T as in A048149.A048150
a(n)=number of numbers h^2+k^2 that are <=2n^2; equivalently, a(n)=T(n,n), array T as in A048149.
- Triangular array T read by rows: T(n,k)=k mod n, for k=1,2,...,n, n=1,2,...A048151
Triangular array T read by rows: T(n,k)=k mod n, for k=1,2,...,n, n=1,2,...
- Triangular array T read by rows: T(n,k) = k^2 mod n, for 1 <= k <= n, n >= 1.A048152
Triangular array T read by rows: T(n,k) = k^2 mod n, for 1 <= k <= n, n >= 1.
- a(n) = Sum_{k=1..n} (k^2 mod n).A048153
a(n) = Sum_{k=1..n} (k^2 mod n).
- Triangular array T read by rows: T(n,k)=k^3 mod n, for k=1,2,...,n, n=1,2,...A048154
Triangular array T read by rows: T(n,k)=k^3 mod n, for k=1,2,...,n, n=1,2,...
- a(n)=Sum{T(n,k): k=1,2,...,n}, array T as in A048154.A048155
a(n)=Sum{T(n,k): k=1,2,...,n}, array T as in A048154.
- Triangular array T read by rows: T(n,k)=k^4 mod n, for k=1,2,...,n, n=1,2,...A048156
Triangular array T read by rows: T(n,k)=k^4 mod n, for k=1,2,...,n, n=1,2,...
- a(n)=Sum{T(n,k): k=1,2,...,n}, array T as in A048156.A048157
a(n)=Sum{T(n,k): k=1,2,...,n}, array T as in A048156.
- Triangular array T read by rows: T(n,k) = n mod k, for k=1,2,...,n, n=1,2,...A048158
Triangular array T read by rows: T(n,k) = n mod k, for k=1,2,...,n, n=1,2,...
- Triangle giving a(n,k) = number of (n,k) labeled Greg trees (n >= 2, 0 <= k <= n-2).A048159
Triangle giving a(n,k) = number of (n,k) labeled Greg trees (n >= 2, 0 <= k <= n-2).
- Triangle giving T(n,k) = number of (n,k) labeled rooted Greg trees (n >= 1, 0<=k<=n-1).A048160
Triangle giving T(n,k) = number of (n,k) labeled rooted Greg trees (n >= 1, 0<=k<=n-1).