19675

Appears in sequences

• Denominators of continued fraction convergents to sqrt(991).at n=9A042919
• 3^(n^2)-2^n.at n=3A120799
• Pascal triangle shifted MacMahon numbers: p(x,n)=If[n < 2, -(-2)^n*(x - 1)^(n + 1)*LerchPhi[x, -n, 1/2], 2*x*(x + 1)^(n - 2) - (-2)^n*(x - 1)^(n + 1)*LerchPhi[x, -n, 1/2]].at n=46A147295
• Monotonic ordering of nonnegative differences 3^i-8^j, for 40>= i>=0, j>=0.at n=28A192155
• Number of ways prime(n) can be expressed as the sum of distinct smaller noncomposites.at n=49A215966
• Numerators of mass formula for connected vacuum graphs on 2n nodes for a phi^3 field theory.at n=6A226260
• Number of n X 2 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=5A229366
• Number of nX6 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=1A229370
• T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=22A229372
• T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally.at n=26A229372
• Number of partitions p of n such that the number of numbers having multiplicity 1 in p is a part and the number of numbers having multiplicity > 1 is not a part.at n=46A241416
• a(n) = ( 2*n*(2*n^2 + 11*n + 26) - (-1)^n + 1 )/16.at n=41A256666
• a(n) = n^3 - 8.at n=27A259348
• In a Kolakoski n-chain, point at which term of penultimate sequence seq(n-1) differs from term of final sequence seq(n) in chain, when terms of seq(i) are run-lengths of seq(i+1) and the chain contains n sequences.at n=24A327421
• Bitwise encoding of the state of a 1D cellular automaton after n steps from ...111000... where adjacent cells swap 01 <-> 10 when within triples 110 or 011.at n=28A359303
• Number of partial orders on {1,2,...,n} that are contained in the usual linear order, whose dual is given by the relabelling k -> n+1-k.at n=9A383370