22112
domain: N
Appears in sequences
- Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=26A008301
- Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=34A008301
- a(n) contains n digits (either '1' or '2') and is divisible by 2^n.at n=4A053312
- Number of step shifted (decimated) sequence structures using a maximum of two different symbols.at n=17A056391
- a(n) is the number of distinct (modulo geometric D3-operations) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=16A060553
- Lesser of two consecutive numbers each divisible by a fifth power.at n=6A068783
- Array in which the n-th row contains the multiples of n using nonzero digits and having a digit sum of n. Sequence contains the rows and a zero entry for rows with no terms (e.g. 10).at n=38A077755
- a(1) = 1, a(2) = 2, a(n) = reverse concatenation of two previous terms.at n=4A091789
- Successive generations of an alternating Kolakoski rule.at n=5A111081
- Integers corresponding to rational knots in Conway's enumeration.at n=26A122495
- Numbers n with property that for each single digit d of the base 3 expansion of n, we can also see the base 3 expansion of d^2 as a substring. Also n may not contain any 0 digits.at n=30A135464
- Numbers 3*n + 2 written in base 3.at n=76A190642
- Left half of Poupard's triangle, A008301.at n=16A210108
- Good's example of a "Standard List" of prime words over the alphabet {1,2}.at n=11A212659
- List of primitive words over the alphabet {1,2}.at n=46A213969
- List of subwords (or factors) of the Thue-Morse "1,2"-word A001285.at n=32A214215
- Triangle read by rows: T(n,k) appears in the transformation Sum_{k=0..n} (k+1)*x^k = Sum_{k=0..n} T(n,k)*(x+k)^k.at n=52A247236
- Consecutive exclusionary squares: Numbers n such that n^2 does not contain digits of n and (n+1)^2 does not contain digits of n+1.at n=51A247843
- Numbers that are divisible by the sum of their digits and for which the sum of digits equals the product of digits.at n=18A280355
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type B^Q terminating at point (n, m).at n=61A291087