18273

Appears in sequences

• Number of partitions into non-integral powers.at n=10A000397
• Triangle T(n,k) giving number of immersions of the oriented circle into the oriented plane with n double points and index k, k = -n-1, -n+1, ..., n-1, n+1.at n=40A008985
• a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3.at n=32A022866
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 90.at n=28A031588
• Where records appear in A109734.at n=35A109740
• Record indices of A135727(n) = max{ A001281^k(n);k=0,1,2,3... } (3x-1 problem).at n=20A135728
• Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=15A252380
• G.f.: Sum_{n=-oo..+oo} x^n * (1 - 2^n*x^n)^n.at n=10A258936
• If x^2 + 2*y^2 is prime for all positive integers x and y with m = x*y then m is in the sequence.at n=10A287799
• Number of nX5 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=5A299604
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A299605
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=49A299607
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=50A299607
• Number of partitions of n with up to eight distinct kinds of 1.at n=21A320695
• T(n,k) is the number permutations p of [n] that are k-dist-increasing but not j-dist-increasing for any j<k, where p is j-dist-increasing if j>=0 and p(i)<p(i+j) for all i in [n-j]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=50A370507