22164

Appears in sequences

• G.f. satisfies: A(x) = 1/(1 + x*A(x^2)) and also the continued fraction: 1 + x*A(x^3) = [1; 1/x, 1/x^2, 1/x^4, 1/x^8, ..., 1/x^(2^(n-1)), ...].at n=46A101912
• Triangle read by rows: T(n,k) is the number of binary trees with n edges and k jumps (n >= 0, 0 <= k <= max(0,ceiling(n/2)-1) ).at n=28A127530
• Numbers n with property that for each single digit d of n, we can also see the decimal expansion of 2^d as a substring of n. Also n may not contain any zero digits.at n=19A135016
• Ulam's spiral (SSE spoke).at n=37A143839
• Number of (n+2)X3 binary arrays avoiding patterns 001 and 111 in rows and columns.at n=7A202371
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns.at n=28A202378
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns.at n=35A202378
• Incorrect version of A045949.at n=19A229620
• Number of 3 X n 0..3 arrays with no element equal to zero plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=27A239987
• Numbers x such that sigma(x) + sigma(R(x)) = sigma(x + R(x)), where R(x) is the digit reversal of x and sigma(x) is the sum of the divisors of x.at n=24A246487
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood.at n=31A268154
• Square array A(n,k): number of integers having k or more factors less than prime(n+1) in their prime factorization, within any interval of primorial(n)^k positive integers.at n=25A281891
• a(n) is the smallest integer k of the form k = x*(x + a(n-1)), such that A324920(k) = n, for some positive integer x, with a(0) = 0.at n=12A307034
• Triangle read by rows: T(n,k) is the number of oriented colorings of the edges of a regular n-D orthotope (or ridges of a regular n-D orthoplex) using exactly k colors. Row n has n*2^(n-1) columns.at n=7A338142
• Triangle read by rows: T(n,k) is the number of oriented colorings of the edges of a regular n-D orthoplex (or ridges of a regular n-D orthotope) using exactly k colors. Row 1 has 1 column; row n>1 has 2*n*(n-1) columns.at n=7A338146