19726
domain: N
Appears in sequences
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=32A062693
- G.f.: A(x) = 1 + x*A(x)*A(-x) + x^2*exp( Sum_{n>=1} 2*L(n)^2*x^(2*n)/n ), where A(x) = exp(Sum_{n>=1} L(n)*x^n/n).at n=26A205566
- Let sequence B_n={b_m} be defined by: b_1=prime(n), b_2=prime(n+1); for m>=3, b_m=b_(m-2)+b_(m-1) if b_(m-2)+b_(m-1) is not semiprime, otherwise b_m is the least prime divisor of b_(m-2)+b_(m-1). Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded.at n=4A221218
- Let sequence B_n={b_m} be defined by: b_1=prime(n), b_2=prime(n+1); for m>=3, b_m=b_(m-2)+b_(m-1) if b_(m-2)+b_(m-1) is not semiprime, otherwise b_m is the least prime divisor of b_(m-2)+b_(m-1). Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded.at n=48A221218
- Number T(n,k) of equivalence classes of ways of placing k 8 X 8 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=8, 0<=k<=floor(n/8)^2, read by rows.at n=49A236915
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum 1 3 6 or 8 and every diagonal and antidiagonal sum not 1 3 6 or 8.at n=12A252008