18526

Appears in sequences

• Numerator of x-coordinate of (2n)*P where P is the generator for rational points on the curve y^2 + y = x^3 - x.at n=6A028936
• a(n) = numerator of the X-coordinate of n*P where P is the generator [0,0] for rational points on the curve y^2 + y = x^3 - x.at n=13A028940
• a(n) = (3*n+1)*(4*n+1).at n=39A033577
• Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.at n=24A067603
• Fourth row of the Pascal-(1,4,1) array A081579.at n=10A081588
• Expansion of eta(q^6) * eta(q^10) / (eta(q) * eta(q^15)) in powers of q.at n=40A094023
• Number of self-avoiding paths with n steps on a triangular lattice in the strip Z x {0,1}.at n=11A100691
• Start with 1 and repeatedly reverse the digits and add 65 to get the next term.at n=33A118163
• Expansion of q * (chi(-q^3) * chi(-q^5)) / (chi(-q) * chi(-q^15))^2 in powers of q where chi() is a Ramanujan theta function.at n=39A123630
• Expansion of f(-q^6) * f(-q^10) / (f(q) * f(q^15)) in powers of q where f() is a Ramanujan theta function.at n=40A145728
• Where records occur in A047160.at n=27A155765
• Number of (n+1) X (5+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=3A253492
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=31A253495
• Number of (4+1) X (n+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=4A253498
• a(n) = 25*n*(n + 1)/2 + 1.at n=38A262221
• Expansion of (eta(q^6) * eta(q^10) / (eta(q) * eta(q^15)))^2 in powers of q.at n=20A263348
• Array read by antidiagonals: T(n,k) is the number of chiral pairs of color patterns (set partitions) in a cycle of length n using k or fewer colors (subsets).at n=115A320742
• Number of chiral pairs of color patterns (set partitions) in a cycle of length n using 5 or fewer colors (subsets).at n=10A320745
• Integers k such that for all m>k, d(m)/m < d(k)/k where d(j) = Min_{p & q odd primes, 2*j = p+q, p <= q} (q-p)/2.at n=21A335297