29296

Appears in sequences

• Sum of first prime(n) primes.at n=28A022094
• Numbers in which all pairs of consecutive base-5 digits differ by 3.at n=19A033076
• a(n) = (2*n^3 - n^2 - n + 2)/2.at n=31A081441
• a(n) = S3(n,1), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.at n=4A089669
• Least k such that k*prime(k) > 10^n.at n=10A090977
• Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and 2w^2>x^2+y^2.at n=20A211632
• Number a(n,k) of positions (cyclic permutations) of circular permutations of [n] with exactly k (unspecified) increasing or decreasing modular runs (3-sequences), with clockwise and counterclockwise traversals counted as distinct; triangle a(n,k) read by rows, 0<=k<=n.at n=36A235943
• Number of length 4 1..(n+2) arrays with no leading partial sum equal to a prime.at n=16A254542
• Number of nX5 0..n*5-1 arrays with upper left zero and lower right n*5-1 and each element differing from its horizontal and diagonal neighbors by a power of two.at n=1A265618
• T(n,k) is the number of n X k 0..n*k-1 arrays with upper left zero and lower right n*k-1 and each element differing from its horizontal and diagonal neighbors by a power of two.at n=16A265619
• Number of 2Xn 0..2*n-1 arrays with upper left zero and lower right 2*n-1 and each element differing from its horizontal and diagonal neighbors by a power of two.at n=4A265620
• Numbers n such that the decimal number concat(9,n) is a square.at n=30A273364
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 833", based on the 5-celled von Neumann neighborhood.at n=30A273677
• Number T(n,k) of permutations p of [n] having at least one index i with |p(i)-i| = k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.at n=31A306506
• Number of permutations p of [n] having at least one index i with |p(i)-i| = 3.at n=8A324366
• Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] in a circle with longest consecutive chain size less than 3, when 1 and n are considered to be consecutive, and rotations are considered to be distinct.at n=44A340108
• Numbers k such that x=(sigma(k) XOR 2*k) divides k in carryless binary arithmetic, when the binary expansions of k and x are interpreted as polynomials in ring GF(2)[X].at n=52A379236