Search: seq:1,1,0,2,1,0,6,6,1,0
|
Sorry, but the terms do not match anything in the table.
The following advanced matches exist for the numeric terms in your query.
|
|
|
|
|
|
|
| Matches after removing first term
|
|
These sequences match the terms with the first removed.
- A111184 Triangle T(n,k), 0<=k<=n, read by rows, given by [0, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] where DELTA is the operator defined in A084938.
(1, 0, 2, 1, 0, 6, 6, 1, 0)
- A111596 The matrix inverse of the unsigned Lah numbers A271703.
(1, 0, -2, 1, 0, 6, -6, 1, 0)
- A129062 T(n, k) = [x^k] Sum_{k=0..n} Stirling2(n, k)*RisingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.
(1, 0, 2, 1, 0, 6, 6, 1, 0)
- A271703 Triangle read by rows: the unsigned Lah numbers T(n, k) = binomial(n-1, k-1)*n!/k! if n > 0 and k > 0, T(n, 0) = 0^n and otherwise 0, for n >= 0 and 0 <= k <= n.
(1, 0, 2, 1, 0, 6, 6, 1, 0)
- A276922 Number T(n,k) of ordered set partitions of [n] where the maximal block size equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
(1, 0, 2, 1, 0, 6, 6, 1, 0)
- ... 6 total
|
|
| Transformations to other sequences
|
|
These sequences match transformations of the original query.
a(n), dropping leading 0s and 1s
= 2, 1, 0, 6, 6, 1, 0
- A339792 Third coefficient of the lindep transform of sigma(n).
(2, -1, 0, -6, -6, 1, 0)
deltas matching: a(n)+1, after dropping leading 0s and 1s
= 3, 2, 1, 7, 7, 2, 1
- A011402 Decimal expansion of 13th root of 18.
(5, 8, 6, 7, 0, 7, 5, 4)
- A020839 Decimal expansion of 1/sqrt(82).
(7, 4, 6, 7, 0, 7, 5, 4)
a(n)-1, after dropping leading 0s and 1s
= 1, 0, -1, 5, 5, 0, -1
- A308356 A(n,k) = (1/k!) * Sum_{i_1=1..n} Sum_{i_2=1..n} ... Sum_{i_k=1..n} (-1)^(i_1 + i_2 + ... + i_k) * multinomial(i_1 + i_2 + ... + i_k; i_1, i_2, ..., i_k), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.
(1, 0, 1, 5, 5, 0, 1)
- A330667 Irregular triangle read by rows where T(n,k) is the number of balanced reduced multisystems of depth k whose atoms are the prime indices of n.
(1, 0, 1, 5, 5, 0, 1)
- A330935 Irregular triangle read by rows where T(n,k) is the number of length-k chains from minimum to maximum in the poset of factorizations of n into factors > 1, ordered by refinement.
(1, 0, 1, 5, 5, 0, 1)
- A336423 Number of strict chains of divisors from n to 1 using terms of A130091 (numbers with distinct prime multiplicities).
(1, 0, 1, 5, 5, 0, 1)
deltas matching: a(n)-1, after dropping leading 0s and 1s
= 1, 0, 1, 5, 5, 0, 1
- A051686 Smallest prime p such that 2n*p+1 is also prime.
(2, 3, 3, 2, 7, 2, 2, 3)
- A069713 As a square array T(n,k) by antidiagonals, number of ways of partitioning k into up to n parts each no more than 5, or into up to 5 parts each no more than n; as a triangle t(n,k), number of ways of partitioning n into exactly k parts each no more than 6 (i.e., of arranging k indistinguishable standard dice to produce a total of n).
(1, 0, 0, 1, 6, 11, 11, 10)
- A070560 a(0) = 1; for n > 0, a(n) = (fecundity of n) + 2.
(10, 9, 9, 8, 3, 8, 8, 7)
- A070561 a(0) = 0; for n > 0, a(n) = (fecundity of n) + 1.
(9, 8, 8, 7, 2, 7, 7, 6)
- A070562 Fecundity of n.
(8, 7, 7, 6, 1, 6, 6, 5)
- ... 9 total
a(n) for odd n
= 1, 0, 1, 6, 1
- A010469 Decimal expansion of square root of 12.
(1, 0, 1, 6, 1)
- A011181 Decimal expansion of 5th root of 96.
(1, 0, 1, 6, 1)
- A030187 Expansion of eta(q) * eta(q^2) * eta(q^7) * eta(q^14) in powers of q.
(-1, 0, 1, 6, -1)
- A037022 Triangle in which row n has the first n digits of sqrt(n) (truncated).
(1, 0, 1, 6, 1)
- A037023 Triangle in which row n lists the first n digits of sqrt(n) (rounded).
(1, 0, 1, 6, 1)
- ... 71 total
deltas matching: a(n) for odd n
= 1, 0, 1, 6, 1
- A008507 Number of odd composite numbers less than n-th odd prime.
(25, 26, 26, 27, 33, 34)
- A008687 Number of 1's in 2's complement representation of -n.
(3, 2, 2, 1, 7, 6)
- A019769 Decimal expansion of 2*e/15.
(4, 3, 3, 2, 8, 9)
- A020900 Greatest k such that k-th prime < twice n-th prime.
(46, 47, 47, 48, 54, 55)
- A021563 Decimal expansion of 1/559.
(1, 0, 0, 1, 7, 8)
- ... 128 total
a(n) for even n
= 1, 2, 0, 6, 0
- A010550 Decimal expansion of square root of 99.
(1, 2, 0, 6, 0)
- A011023 Decimal expansion of 4th root of 28.
(1, 2, 0, 6, 0)
- A013667 Decimal expansion of zeta(9).
(1, 2, 0, 6, 0)
- A019658 Decimal expansion of sqrt(Pi*e)/14.
(1, 2, 0, 6, 0)
- A035167 Coefficients in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m = -23.
(1, 2, 0, 6, 0)
- ... 57 total
deltas matching: a(n) for even n
= 1, 2, 0, 6, 0
- A021747 Decimal expansion of 1/743.
(8, 9, 7, 7, 1, 1)
- A051160 Coefficients in expansion of (1-x)^floor(n/2)(1+x)^ceiling(n/2).
(0, -1, 1, 1, -5, -5)
- A062707 Table by antidiagonals of n*k*(k+1)/2.
(3, 2, 0, 0, 6, 6)
- A064764 Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies lcm(p_i, p_{i+1}) >= m for some i, 1 <= i <= n-1.
(3, 4, 6, 6, 12, 12)
- A073822 Decimal expansion of number with continued fraction expansion 0, 1, 1, 2, 3, 5, ... (the Fibonacci numbers).
(5, 6, 8, 8, 2, 2)
- ... 46 total
a(n) - 3
= -2, -2, -3, -1, -2, -3, 3, 3, -2, -3
- A109035 Number of irreducible partitions into squares. A partition is irreducible if no subpartition with 2 or more parts sums to a square.
(2, 2, 3, 1, 2, 3, 3, 3, 2, 3)
- A109036 Number of irreducible partitions into smaller squares. A partition is irreducible if no subpartition with 2 or more parts sums to a square smaller than n.
(2, 2, 3, 1, 2, 3, 3, 3, 2, 3)
- A276172 Number of primitive prime divisors of 3^n - 2^n.
(2, 2, 3, 1, 2, 3, 3, 3, 2, 3)
deltas matching: a(n+2) - a(n+1) + a(n)
= 0, 3, 1, 1, 7, 0, 1, 5
- A354954 Decimal expansion of Sum_{p = primes} 1 / (p * log(p)^4).
(4, 4, 1, 0, 1, 8, 8, 7, 2)
coefficients of Sn(z) / (1+z)^2
= 1, -1, 1, 1, -2, 3, 2, -1, 1, -1
Sn(z) denotes the ordinary generating function with coefficients a(n).
- A003989 Triangle T from the array A(x, y) = gcd(x,y), for x >= 1, y >= 1, read by antidiagonals.
(1, 1, 1, 1, 2, 3, 2, 1, 1, 1)
- A008406 Triangle T(n,k) read by rows, giving number of graphs with n nodes (n >= 1) and k edges (0 <= k <= n(n-1)/2).
(1, 1, 1, 1, 2, 3, 2, 1, 1, 1)
- A030337 Length of n-th run of digit 1 in A003137.
(1, 1, 1, 1, 2, 3, 2, 1, 1, 1)
- A030347 Length of n-th run of digit 1 in A030341.
(1, 1, 1, 1, 2, 3, 2, 1, 1, 1)
- A031262 Length of n-th run of digit 2 in A031253.
(1, 1, 1, 1, 2, 3, 2, 1, 1, 1)
- ... 30 total
deltas matching: coefficients of Sn(z) / (1+z)^2
= 1, 1, 1, 1, 2, 3, 2, 1, 1, 1
Sn(z) denotes the ordinary generating function with coefficients a(n).
- A028792 Nonsquares mod 79.
(57, 58, 59, 60, 61, 63, 66, 68, 69, 70, 71)
- A107743 Numbers m such that m+(digit sum of m) is a composite number.
(27, 28, 29, 30, 31, 33, 36, 38, 39, 40, 41)
- A127201 Base-2 logarithms of denominators corresponding to A127200.
(24, 25, 26, 27, 28, 26, 29, 31, 32, 33, 34)
- A160531 Those positive integers n that contain both odd-lengthed and even-lengthed runs of 0's and 1's when n is represented in binary.
(24, 25, 26, 27, 28, 30, 33, 35, 36, 37, 38)
- A176494 Least m >= 1 for which |2^m - prime(n)| is prime.
(2, 1, 2, 1, 2, 4, 1, 3, 2, 1, 2)
- ... 29 total
multiples of: coefficients of Sn(z) / (1+z)^2
= 1, -1, 1, 1, -2, 3, 2, -1, 1, -1
Sn(z) denotes the ordinary generating function with coefficients a(n).
- A067970 First differences of A014076, the odd nonprimes.
(2, 2, 2, 2, 4, 6, 4, 2, 2, 2)
- A143594 Triangle read by rows, A051731 * (an infinite lower triangular matrix with 1's in the first column and the rest 2's).
(2, 2, 2, 2, 4, 6, 4, 2, 2, 2)
- A164510 First differences of A071904 (Odd composite numbers).
(2, 2, 2, 2, 4, 6, 4, 2, 2, 2)
- A299484 Irregular triangle read by rows in which T(n,k) is the number of cells in the k-th level of the diagram of the symmetric representation of sigma(n).
(2, 2, 2, 2, 4, 6, 4, 2, 2, 2)
abs(a(n)), sorted with duplicates removed
= 0, 1, 2, 6
- A000957 Fine's sequence (or Fine numbers): number of relations of valence >= 1 on an n-set; also number of ordered rooted trees with n nodes having root of even degree.
(0, 1, 2, 6)
- A001373 Number of functional digraphs (digraphs of functions on n nodes where every node has outdegree 1 and loops of length 1 are forbidden).
(0, 1, 2, 6)
- A001434 Number of graphs with n nodes and n edges.
(0, 1, 2, 6)
- A001654 Golden rectangle numbers: F(n)*F(n+1), where F(n) = A000045(n) (Fibonacci numbers).
(0, 1, 2, 6)
- A002527 Number of permutations p on the set [n] with the properties that abs(p(i)-i) <= 3 for all i and p(1) <= 3.
(0, 1, 2, 6)
- ... 679 total
deltas matching: abs(a(n)), sorted with duplicates removed
= 0, 1, 2, 6
- A000085 Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.
(1, 1, 2, 4, 10)
- A000241 Crossing number of complete graph with n nodes.
(0, 0, 1, 3, 9)
- A000458 a(0) = a(1) = 1; thereafter a(n) = sigma(a(n-1)) + sigma(a(n-2)).
(1, 1, 2, 4, 10)
- A000682 Semi-meanders: number of ways a semi-infinite directed curve can cross a straight line n times.
(1, 1, 2, 4, 10)
- A000916 a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.
(4, 4, 3, 5, 11)
- ... 781 total
a(n), dropping 4 terms
= 1, 0, 6, 6, 1, 0
- A058150 Triangle: Number of asymmetric commutative monoids of order n with k idempotents.
(1, 0, 6, 6, 1, 0)
- A058151 Triangle: Number of asymmetric self-converse monoids of order n with k idempotents.
(1, 0, 6, 6, 1, 0)
- A110330 Inverse of a number triangle related to the Pell numbers.
(1, 0, -6, -6, 1, 0)
- A132014 T(n,j) for double application of an iterated mixed order Laguerre transform: Coefficients of Laguerre polynomial (-1)^n*n!*L(n,2-n,x).
(1, 0, 6, -6, 1, 0)
- A137651 Triangle read by rows: T(n,k) is the number of primitive (aperiodic) word structures of length n using exactly k different symbols.
(1, 0, 6, 6, 1, 0)
- ... 10 total
deltas matching: a(n), dropping 4 terms
= 1, 0, 6, 6, 1, 0
- A026099 Row of A026098 that contains n.
(8, 9, 9, 15, 9, 10, 10)
- A057213 Second term of continued fraction for exp(n).
(2, 1, 1, 7, 1, 2, 2)
- A060209 Dunckley sequence: number of bases in which the n-th composite number is a Smith number.
(2, 1, 1, 7, 1, 2, 2)
- A062283 Square array read by descending antidiagonals: T(n,k) = floor(n^k/k^n).
(1, 0, 0, 6, 0, 1, 1)
- A155992 Decimal expansion of log_17 (24).
(1, 2, 2, 8, 2, 3, 3)
- ... 9 total
|
Search completed in 0.012 seconds
|