19179

Appears in sequences

• a(1)=1, then a(n)=2*a(n-1) if n is prime, a(n)=2*a(n-1)+1 if n not prime.at n=14A118255
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 2, read by rows.at n=30A157153
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) - m*k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 2, read by rows.at n=33A157153
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having one, two, three, four, six or seven distinct values for every i,j,k<=n.at n=5A211741
• Permutation of natural numbers: a(n) = A245707(A245608(n)).at n=58A245706
• Number of subsets of {1,...,n} containing n and having at least one set partition into 6 blocks with equal element sum.at n=10A248115
• Numbers k such that the concatenation of 2^k - 1 and 2^(k - 1) - 1 is prime.at n=22A301806
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 8 king-move adjacent elements, with upper left element zero.at n=8A316213
• Number of integer partitions of n with all equal lengths of maximal runs of consecutive parts decreasing by 1 but not by 0.at n=49A384904