20079
domain: N
Appears in sequences
- Numbers n such that 73*2^n-1 is prime.at n=11A050562
- a(n) = a(n-1) XOR Sum_{k=1..n-1} a(k), with a(1)=1, a(2)=3, where XOR is the binary exclusive OR operation.at n=14A099811
- Integers that are Rhonda numbers to base 15.at n=7A100974
- Number of permutations of length n which avoid the patterns 1234, 1342, 2431.at n=9A116752
- a(n) = Sum_{k=0..[n/2]} C(n-k,k)^2 * n/(n-k), n>=1.at n=11A167539
- Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=6A186474
- Number of (n+1)X8 0..3 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=0A186480
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=21A186482
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=27A186482
- T(n,m)=Number of (n+1)X2 0..m arrays with every 2X2 subblock commuting with each of its vertical 2X2 subblock neighbors.at n=42A187363
- a(0)=1, a(n) = least k > a(n-1) such that k*a(n-1) is a triangular number.at n=24A213005
- a(n) = n-th Rhonda number to base b = n-th composite number, cf. A002808.at n=7A255880
- Number of 3-colored integer partitions such that no adjacent parts have the same color.at n=12A262444
- Indices of records in A365260.at n=9A366060