19175
domain: N
Appears in sequences
- Self-convolution of row n of array T given by A026736.at n=8A027215
- a(n) = nextprime(3^n) - 2^n.at n=9A037127
- Numbers k such that k^2 is composed of three 1-digit-overlapping subsquares.at n=11A048426
- Expansion of (1-x)/(1-x-x^3-x^4+x^5).at n=27A052532
- A simple grammar: power set of pairs of sequences.at n=24A052812
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=30A059828
- Number of permutations of length n which avoid the patterns 2134, 3241, 3421.at n=9A116763
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 0, -1), (0, 1, 1), (1, -1, 1)}.at n=9A148859
- a(n) = (2*n^3 + 5*n^2 - 7*n)/2.at n=25A162261
- Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=2A237475
- Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=1A237476
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=7A237481
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median of every 2X2 subblock equal.at n=8A237481
- Number of isoscent sequences of length n with maximal number of descents.at n=45A243484
- a(n) = n*(n+1)*(7*n+2)/6.at n=25A255211
- Numbers k such that k and k+1 are both hoax numbers (A019506).at n=33A329935
- Partial sums of the ziggurat sequence A347186.at n=43A356351
- Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k symmetric peaks, with k >= 0.at n=38A372883