20570
domain: N
Appears in sequences
- a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix P^n + T^n, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,1,1,1].at n=17A109525
- Number of (n+1) X (5+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock.at n=8A235951
- Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=3A264013
- Number of (n+1) X (4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=3A264014
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=24A264017
- Number of (4+1) X (n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,2 or 2,2.at n=3A264019
- Numbers k such that (13*10^k + 83) / 3 is prime.at n=24A276322
- a(n) = Product_{d|n, d<n} prime(1+A056239(d)), where A056239(d) gives the weight of the partition whose Heinz-number is d.at n=62A319352
- Position in A356226 of first appearance of the n-th composition in standard order (row n of A066099).at n=29A356603
- G.f. satisfies A(x) = 1 + x*(1 + 1/A(x)^5).at n=5A364409