38963

Appears in sequences

• Pseudoprimes to base 15.at n=37A020143
• Strong pseudoprimes to base 56.at n=15A020282
• Strong pseudoprimes to base 59.at n=28A020285
• Strong pseudoprimes to base 70.at n=25A020296
• a(n) = (2*n - 1)*(3*n^2 - 3*n + 2)/2.at n=23A063491
• Numbers less than the maximum possible determinant A085000(4)=40800 not occurring as determinant of a 4 X 4 matrix with elements 1..16.at n=3A088237
• Number of binary strings of length n with equal numbers of 00100 and 10001 substrings.at n=16A164240
• E.g.f. is series reversion of log(1+x)*sqrt(1-x^2).at n=6A224080
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps.at n=52A246186
• Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00001011 00010101 or 01010101.at n=16A261373
• a(n) = Sum_{k=1..n} floor(n/k)^3.at n=31A318742
• Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 1 and t = 1234.at n=8A324132
• Divide the positive integers into subsets of lengths given by successive primes. a(n) is the sum of primes contained in the n-th subset.at n=33A344718