login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: seq:1,1,0,1,2,0,1,6,6,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.
  • A085845 Triangle T(n, k) read by rows; given by [0, 1, 0, 1, 0, 1, ...] DELTA [1, 1, 2, 5, 14, 42, 132, 429, 1430, ...] (A000108) where DELTA is DelĂ©ham's operator defined in A084938.
    (1, 0, 1, 2, 0, 1, 6, 6, 0)
  • A089949 Triangle T(n,k), read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] where DELTA is the operator defined in A084938.
    (1, 0, 1, 2, 0, 1, 6, 6, 0)
  • A114329 Triangle T(n,k) is the number of partitions of an n-set into lists (cf. A000262) with k lists of size 1.
    (1, 0, 1, 2, 0, 1, 6, 6, 0)
  • A131689 Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n.
    (1, 0, 1, 2, 0, 1, 6, 6, 0)
  • A138106 A triangular sequence of coefficients based on the expansion of a Morse potential type function: p(x,t) = exp(x*t)*(exp(-2*t) - 2*exp(-t)).
    (-1, 0, -1, 2, 0, -1, -6, 6, 0)
  • ... 7 total
Transformations to other sequences
These sequences match transformations of the original query.

a(n), dropping leading 0s and 1s = 2, 0, 1, 6, 6, 0
  • A321434 Triangle read by rows; T(n,k) is the number of achiral rows of n colors using exactly k colors.
    (2, 0, 1, 6, 6, 0)
deltas matching: a(n), dropping leading 0s and 1s = 2, 0, 1, 6, 6, 0
  • A010525 Decimal expansion of square root of 73.
    (5, 3, 3, 2, 8, 2, 2)
  • A115284 Correlation triangle of 4-C(1,n)-2*C(0,n) (A113311).
    (1, 3, 3, 4, 10, 4, 4)
  • A174550 Run lengths of 2 or larger for consecutive prime numbers in A006577.
    (5, 3, 3, 2, 8, 2, 2)
  • A346404 Decimal expansion of Sum_{k>=1} A003418(k)/k!.
    (3, 5, 5, 6, 0, 6, 6)
  • A366632 Number of distinct prime divisors of 7^n - 1.
    (8, 6, 6, 5, 11, 5, 5)
a(n)+1, after dropping leading 0s and 1s = 3, 1, 2, 7, 7, 1
  • A183759 Unlabeled super-Catalan numbers: patterns of nonintersecting chords joining unlabeled points on a circle, triangle decomposed by number of chords.
    (3, 1, 2, 7, 7, 1)
  • A209557 Triangle of coefficients of polynomials u(n,x) jointly generated with A209558; see the Formula section.
    (3, 1, 2, 7, 7, 1)
deltas matching: a(n)+1, after dropping leading 0s and 1s = 3, 1, 2, 7, 7, 1
  • A046886 Number of divisors d of 2n satisfying (d+1) = prime or number of prime factors of the denominator of the even Bernoulli numbers.
    (6, 3, 4, 2, 9, 2, 3)
  • A086668 Number of divisors d of n such that 2d+1 is a prime.
    (5, 2, 3, 1, 8, 1, 2)
  • A097294 Contains exactly once every triple i,j,k such that i>j>k>0.
    (2, 5, 4, 2, 9, 2, 1)
  • A196762 Decimal expansion of the least x > 0 satisfying 4=x*sin(x).
    (4, 1, 2, 0, 7, 0, 1)
  • A198369 Decimal expansion of least x having 4*x^2+4x=cos(x).
    (3, 6, 5, 7, 0, 7, 8)
  • ... 13 total
a(n)-1, after dropping leading 0s and 1s = 1, -1, 0, 5, 5, -1
  • A024714 a(n) = residue mod 7 of n-th term of A024702.
    (1, 1, 0, 5, 5, 1)
  • A105794 Inverse of a generalized Stirling number triangle of first kind.
    (-1, 1, 0, 5, 5, 1)
  • A321746 Irregular triangle read by rows where T(H(u),H(v)) is the coefficient of e(v) in m(u), where H is Heinz number, m is monomial symmetric functions, and e is elementary symmetric functions.
    (-1, 1, 0, -5, 5, -1)
  • A321914 Tetrangle where T(n,H(u),H(v)) is the coefficient of e(v) in m(u), where u and v are integer partitions of n, H is Heinz number, m is monomial symmetric functions, and e is elementary symmetric functions.
    (-1, 1, 0, -5, 5, -1)
deltas matching: a(n)-1, after dropping leading 0s and 1s = 1, 1, 0, 5, 5, 1
  • A010608 Decimal expansion of cube root of 37.
    (6, 7, 6, 6, 1, 6, 7)
  • A016510 Continued fraction for log(82).
    (1, 2, 1, 1, 6, 1, 2)
  • A048652 Continued fraction for Product_{k >= 1} (1-1/2^k) (Cf. A048651).
    (1, 2, 1, 1, 6, 1, 2)
  • A050327 Number of factorizations into distinct squarefree factors indexed by prime signatures. A050326(A025487).
    (0, 1, 0, 0, 5, 0, 1)
  • A053383 Triangle T(n,k) giving denominator of coefficient of x^(n-k) in Bernoulli polynomial B(n, x), n >= 0, 0 <= k <= n.
    (1, 2, 1, 1, 6, 1, 2)
  • ... 45 total
a(n) for odd n = 1, 0, 2, 1, 6
  • A004560 Expansion of sqrt(5) in base 7.
    (1, 0, 2, 1, 6)
  • A005299 Representation degeneracies for Neveu-Schwarz strings.
    (1, 0, 2, 1, 6)
  • A021650 Decimal expansion of 1/646.
    (1, 0, 2, 1, 6)
  • A047265 Triangle T(n,k), for n >= 1, 1 <= k <= n, read by rows, giving coefficient of x^n in expansion of (Product_{j>=1} (1-(-x)^j) - 1 )^k.
    (1, 0, -2, -1, 6)
  • A051626 Period of decimal representation of 1/n, or 0 if 1/n terminates.
    (1, 0, 2, 1, 6)
  • ... 41 total
deltas matching: a(n) for odd n = 1, 0, 2, 1, 6
  • A010249 Continued fraction for cube root of 19.
    (2, 3, 3, 1, 2, 8)
  • A010770 Decimal expansion of 8th root of 2.
    (6, 5, 5, 7, 6, 0)
  • A010778 Decimal expansion of 16th root of 2.
    (3, 2, 2, 0, 1, 7)
  • A011174 Decimal expansion of 5th root of 89.
    (6, 5, 5, 3, 2, 8)
  • A011324 Decimal expansion of 10th root of 13.
    (5, 6, 6, 8, 7, 1)
  • ... 109 total
a(n) for even n = 1, 1, 0, 6, 0
  • A008573 Digits of powers of 13.
    (1, 1, 0, 6, 0)
  • A011243 Decimal expansion of 19th root of 7.
    (1, 1, 0, 6, 0)
  • A011446 Decimal expansion of 27th root of 27.
    (1, 1, 0, 6, 0)
  • A021447 Decimal expansion of 1/443.
    (1, 1, 0, 6, 0)
  • A021881 Decimal expansion of 1/877.
    (1, 1, 0, 6, 0)
  • ... 84 total
deltas matching: a(n) for even n = 1, 1, 0, 6, 0
  • A011200 Decimal expansion of 6th root of 5.
    (5, 4, 3, 3, 9, 9)
  • A011256 Decimal expansion of 17th root of 8.
    (7, 8, 9, 9, 3, 3)
  • A071203 Integer part of n divided by its largest digit (decimal notation).
    (6, 5, 4, 4, 10, 10)
  • A099891 XOR difference triangle of A003188 (Gray code numbers), read by rows.
    (4, 5, 6, 6, 12, 12)
  • A115210 a(0)=0. a(n) = number of earlier terms of the sequence which when added to n produce a composite number.
    (7, 6, 7, 7, 13, 13)
  • ... 56 total
deltas matching: coefficients of 1/Sn(z) = 1, 1, 1, 2, 1, 0, 1, 1, 2, 5
Sn(z) denotes the ordinary generating function with coefficients a(n).
  • A138304 Number of prime primitive roots of prime(n).
    (2, 3, 4, 3, 5, 4, 4, 5, 6, 4, 9)
  • A257694 a(0) = 1; for n >= 1, a(n) = A060130(n) * a(A257684(n)).
    (2, 3, 2, 3, 1, 2, 2, 3, 4, 6, 1)
a(n+3) - 3*a(n+2) + 3*a(n+3) - a(n) = 3, -2, -3, 6, 1, -9, -1
  • A016652 Decimal expansion of log(29).
    (3, 2, 3, 6, 1, 9, 1)
deltas matching: a(n+3) - 3*a(n+2) + 3*a(n+3) - a(n) = 3, 2, 3, 6, 1, 9, 1
  • A020673 Numbers of form x^2 + 10 y^2.
    (11, 14, 16, 19, 25, 26, 35, 36)
a(n) - 3 = -2, -2, -3, -2, -1, -3, -2, 3, 3, -3
  • A193990 Number of distinct prime factors <= n of binomial(2*n,n).
    (2, 2, 3, 2, 1, 3, 2, 3, 3, 3)
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)
  • ... 676 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)
  • ... 788 total

Search completed in 0.012 seconds

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 17:12 EDT 2024. Contains 374234 sequences. (Running on oeis4.)