39960

Appears in sequences

• Numbers whose set of base 6 digits is {0,5}.at n=40A097252
• a(n) is the smallest number m such that the sum of the digits of n+m is n.at n=38A130692
• a(n) = A131668(n) - (2*n+1).at n=19A131766
• Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1001-1111-0110 pattern in any orientation.at n=16A147419
• a(n) = 8000*n - 40.at n=4A157660
• a(n) = 100*n^2 - 2*n.at n=20A158129
• a(n) = 1600*n^2 - 40.at n=4A158773
• Number of reduced 3 X 3 semimagic squares with magic sum n.at n=26A173728
• The Wiener index of the Dutch windmill graph D(6,n) (n>=1).at n=29A180578
• Number of 3-step king's tours on an n X n board summed over all starting positions.at n=27A186862
• Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=17A190108
• a(n) = 9*a(n-1) - 7*a(n-2), with a(0)=0, a(1)=1.at n=6A190984
• Number of partitions p of n such that median(p) < mean(p).at n=40A240217
• Number of (n+1)X(4+1) 0..2 arrays with no 2X2 subblock having its maximum diagonal element less than its minimum antidiagonal element.at n=0A250909
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having its maximum diagonal element less than its minimum antidiagonal element.at n=6A250913
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having its maximum diagonal element less than its minimum antidiagonal element.at n=9A250913
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood.at n=39A271150
• Coefficients in expansion of E_8*Delta^2 where Delta is the generating function of Ramanujan's tau function (A000594).at n=2A290180
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=23A321711
• Number T(n,k) of colored integer partitions of n using all colors of a k-set such that all parts have different color patterns and a pattern for part i has i distinct colors in increasing order; triangle T(n,k), n>=0, min(j:A001787(j)>=n)<=k<=n, read by rows.at n=29A326914