18172

Appears in sequences

• Number of partitions of n into parts not of the form 23k, 23k+7 or 23k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=37A035995
• Number of partitions satisfying cn(1,5) < cn(2,5) + cn(3,5) and cn(4,5) < cn(2,5) + cn(3,5).at n=40A039888
• Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=49A056219
• Numbers k such that 80*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=21A056694
• Arises from a social choice theory problem. Sequence is a transformation of the number of non-transitive non-quasitransitive acyclic distinct profiles with 3 alternatives and strict individual preferences.at n=5A082678
• Number of partitions of n which represent first player winning Chomp positions with unique winning moves.at n=39A112472
• Number of length 5 nonnegative integer arrays starting and ending with 0 with adjacent elements unequal but differing by no more than n.at n=23A205342
• Number of (n+1)X(n+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=1A206189
• Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=1A206191
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two.at n=4A206197
• Number of n X n 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=4A207945
• Number of nX5 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=4A207946
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=40A207949
• Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=4A207951
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=2|x-y|+2|y-z|.at n=42A212576
• Number of partitions p of n such that the m(M(p)) is a part, where m = multiplicity, M = the minimum multiplicity of the parts of p.at n=41A240539
• 50-gonal numbers: a(n) = 48*n*(n-1)/2 + n.at n=28A261343
• Number of 3Xn arrays containing n copies of 0..3-1 with no element plus any horizontal or vertical neighbor equal to 3-1.at n=8A265664
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 902", based on the 5-celled von Neumann neighborhood.at n=43A273760
• 1/4 of the number of self-avoiding paths that are made of alternated vertical and horizontal n consecutive steps. (start point is different from end point.)at n=16A292793