20040

Appears in sequences

• From random walks on complete directed triangle.at n=19A007829
• s(n+3)/4, where s is A024959.at n=11A024960
• Row 6 of square array defined in A047662.at n=7A047663
• Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 that start at an odd level.at n=48A102405
• Number of orbits of the 5-step recursion mod n.at n=49A106287
• Number of partitions of n with no part larger than n/2. Also partitions of n into n/2 or fewer parts.at n=37A110618
• Q(n,6), where Q(m,k) is defined in A127080 and A127137.at n=36A127148
• Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 10 all are equal.at n=20A135120
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=8.at n=34A135193
• Records in A139251.at n=50A152768
• G.f.: [Sum_{n>=0} x^(n*(n+1)/2) * (1+x)^n ]^3.at n=36A182152
• Values of the difference d for 6 primes in arithmetic progression with the minimal start sequence {7 + j*d}, j = 0 to 5.at n=9A206040
• Values of the difference d for 7 primes in arithmetic progression with the minimal start sequence {7 + j*d}, j = 0 to 6.at n=5A206041
• Number of partitions of n in which all parts are less than n/2.at n=37A210249
• Duplicate of A210249.at n=36A233771
• a(n) = A253100(2^n-1).at n=7A253101
• Integers n such that n^2 = 2*x*(y-x), where x and y are consecutive terms in A014574.at n=25A255230
• Number of n X n binary arrays with row sums nondecreasing and columns lexicographically nondecreasing.at n=4A267239
• Number of nX5 binary arrays with row sums nondecreasing and columns lexicographically nondecreasing.at n=4A267242
• T(n,k)=Number of nXk binary arrays with row sums nondecreasing and columns lexicographically nondecreasing.at n=40A267245