21142
domain: N
Appears in sequences
- a(n) = self-convolution of row n of array T given by A026536.at n=7A027267
- Variation of Boustrophedon transform applied to all-1's sequence (see Comments for details).at n=8A059216
- The array in A059216 read by antidiagonals in 'up' direction.at n=36A059217
- The array in A059216 read by antidiagonals in the direction in which it was constructed.at n=44A059234
- Each permutation in the list A060117 converted to Site Swap notation, with digits reversed. "Zero throws" (fixed elements) indicated with 0's.at n=35A060496
- Numbers k that, when expressed in base 5 and then interpreted in base 9, give a multiple of k.at n=30A062931
- Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.at n=30A063444
- Number of primitive (aperiodic) word structures of length n using an infinite alphabet.at n=9A082951
- a(n) = round(n*Pi^n).at n=6A092786
- a(n) = prime(prime(prime(A028815(n) - 1) - 1) - 1) - 1.at n=20A141133
- a(n) = 729*n + 1.at n=28A158397
- G.f. is the polynomial (1-x^3) * (1-x^6) * (1-x^9) * (1-x^12) * (1-x^15) * (1-x^18) * (1-x^21) * (1-x^24) * (1-x^27) / (1-x)^9.at n=9A162602
- a(n) = 22*n^2.at n=31A195323
- Multiples of 682.at n=31A200860
- Number of minimal palindromic words of length n over {1,2} that begin with 1.at n=33A225368
- a(n) = Fibonacci(n) represented in bijective base-4 numeration.at n=14A282235
- Expansion of Product_{k>=1} B(x^k), where B(x) is the g.f. of A003114.at n=30A327690
- Antichain-Chain Quilt Numbers: Square table of the number of ASM quilts of type A_2(j) x C_k read down antidiagonals, where C_k is the chain poset or rank k and A_2(j) is the rank 2 poset with a unique minimal and maximal element and j atoms.at n=48A374822