Summary of block A237
Sequences in block A237
Section titled “Sequences in block A237”-
A237132: Values of x in the solutions to x^2 - 3xy + y^2 + 11 = 0, where 0 < x < y.
-
A237187: Total number of possible evolutions arising from n tandem duplications of DNA.
-
A237268: a(1)=1; for n > 1, a(n) is the smallest F(m) > F(n) such that F(n) divides F(m), where F(k) denotes the k-th Fibonacci number.
-
A237275: Smallest k divisible by the n-th power of its last decimal digit > 1.
-
A237419: 4^(n+1)^2 - 3.
-
A237420: If n is odd, then a(n) = 0; otherwise, a(n) = n.
-
A237514: Numbers k such that 2^(k-1) < 3^(m-1) < 2^k < 3^m < 2^(k+1), for some m > 2, a(1) = 1.
-
A237516: Pyramidal centered square numbers.
-
A237580: a(n) = (2n)! - n! + 1.
-
A237616: a(n) = n*(n + 1)*(5*n - 4)/2.
-
A237622: Interpolation polynomial through n points (0,1), (1,1), …, (n-2,1) and (n-1,n) evaluated at 2n, a(0)=1.
-
A237664: Interpolation polynomial through n+1 points (0,1), (1,1), …, (n-1,1) and (n,n) evaluated at 2n.
-
A237684: a(n) = floor(n*prime(n) / Sum_{i<=n} prime(i)).
-
A237695: Maximum length of a +- 1 sequence of discrepancy n.
-
A237930: a(n) = 3^(n+1) + (3^n-1)/2.
-
A237991: a(n) = 991*n^2 + 1.