26042

Appears in sequences

• Successive approximations to 11-adic integer sqrt(3).at n=5A034946
• Number of black-square subarrays of (n+2) X (1+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=12A230928
• Number of black-square subarrays of (n+2) X (1+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=13A230928
• Number of n X 3 0..3 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=7A231103
• T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=52A231108
• Number of unordered pairs {p,q} of partitions of n into distinct parts such that p and q are incomparable in the dominance order.at n=34A265508
• Permutation of natural numbers: a(0) = 1, a(1) = 2, a(2n) = A273669(a(n)), a(2n+1) = A273664(a(n)).at n=64A275716
• a(n) = (2*5^n + 3*(-1)^(floor((n-1)/3)) + (-1)^n)/6.at n=7A276508
• One of the two successive approximations up to 11^n for 11-adic integer sqrt(3). Here the 5 (mod 11) case (except for n = 0).at n=5A321072
• The number of n-digit numbers which are divisible by 3 and where all decimal digits are odd.at n=6A337753