Summary of block A062
Sequences in block A062
Section titled “Sequences in block A062”-
A062000: a(n) = a(n-1)^2 - a(n-2)^2 with a(0) = 0, a(1) = 2.
-
A062002: Gamma_0(n) has genus 0 and does not contain any elliptic elements.
-
A062013: a(1) = 3, a(n) = a(n-1)^2 + 1.
-
A062026: a(n) = n*(n+1)*(n^2 - 3*n + 6)/4.
-
A062050: n-th chunk consists of the numbers 1, …, 2^n.
-
A062074: a(n) = n^3 * 3^n.
-
A062075: a(n) = n^4 * 4^n.
-
A062077: a(n) = (2n)^n * n^(2n).
-
A062092: a(n) = 2*a(n-1) - (-1)^n for n > 0, a(0)=2.
-
A062097: a(1) = 1; a(n) = sum of the sum and the product of all previous terms.
-
A062098: a(n) = 7 * n!.
-
A062107: Diagonal of table A062104.
-
A062114: a(n) = 2*Fibonacci(n) - (1 - (-1)^n)/2.
-
A062116: a(n) = 2^n mod 17.
-
A062119: a(n) = n! * (n-1).
-
A062123: a(n) = (9n^2 + 9n + 4)/2.
-
A062124: Fourth column of A046741.
-
A062141: Third column sequence of coefficient triangle A062137 of generalized Laguerre polynomials n!*L(n,3,x).
-
A062148: Second (unsigned) column sequence of triangle A062138 (generalized a=5 Laguerre).
-
A062153: a(n) = floor(log_3(n)).
-
A062157: a(n) = 0^n - (-1)^n.
-
A062158: a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).
-
A062159: a(n) = n^5 - n^4 + n^3 - n^2 + n - 1.
-
A062173: a(n) = 2^(n-1) mod n.
-
A062174: a(n) = 3^(n-1) mod n.
-
A062175: a(n) = 4^(n-1) mod n.
-
A062176: a(n) = 5^(n-1) mod n.
-
A062199: Second (unsigned) column sequence of triangle A062140 (generalized a=4 Laguerre).
-
A062206: a(n) = n^(2n).
-
A062231: Numbers k such that the smoothly undulating palindromic number (97*10^k - 79)/99 is a prime.
-
A062260: Third (unsigned) column sequence of triangle A062140 (generalized a=4 Laguerre).
-
A062278: a(n) = floor(3^n / n^3).
-
A062282: Number of permutations of n elements with an even number of fixed points.
-
A062317: Numbers k such that 5*k-1 is a perfect square.
-
A062318: Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.
-
A062346: Consider 2n tennis players; a(n) is the number of matches needed to let every possible pair play each other.
-
A062383: a(0) = 1: for n>0, a(n) = 2^floor(log_2(n)+1) or a(n) = 2*a(floor(n/2)).
-
A062392: a(n) = n^4 - (n-1)^4 + (n-2)^4 - … 0^4.
-
A062393: a(n) = n^5 - (n-1)^5 + (n-2)^5 - … +(-1)^n*0^5.
-
A062394: a(n) = 6^n + 1.
-
A062395: a(n) = 8^n + 1.
-
A062396: a(n) = 9^n + 1.
-
A062397: a(n) = 10^n + 1.
-
A062458: Nearest integer to (n+1)^(n+1)/n^n.
-
A062508: a(n) = 3^(2n)+7.
-
A062510: a(n) = 2^n + (-1)^(n+1).
-
A062544: a(n) = n plus sum of previous three terms.
-
A062545: Continued fraction for the 2nd du Bois-Reymond constant.
-
A062561: a(n) = 3*binomial(2*n, n-1).
-
A062588: Numbers k such that 22^k - 21^k is prime.
-
A062597: Numbers k such that 31^k - 30^k is prime.
-
A062605: Numbers k such that 39^k - 38^k is prime.
-
A062609: Numbers k such that 43^k - 42^k is prime or a strong pseudoprime.
-
A062615: Numbers k such that 49^k - 48^k is prime.
-
A062621: Numbers k such that 55^k - 54^k is prime.
-
A062640: Numbers k such that 74^k - 73^k is prime.
-
A062643: Numbers k such that 77^k - 76^k is prime.
-
A062644: Numbers k such that 78^k - 77^k is prime.
-
A062651: Numbers k such that 85^k - 84^k is prime.
-
A062659: Numbers k such that 93^k - 92^k is prime.
-
A062665: Numbers k such that 99^k - 98^k is prime.
-
A062708: Write 0,1,2,3,4,… in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,…
-
A062709: a(n) = 2^n + 3.
-
A062714: Minimal length of a sequence with terms from {1, 2, 3, …, n} which contains, as a subsequence, each possible ordering of the n symbols 1, 2, 3, …, n.
-
A062717: Numbers m such that 6*m+1 is a perfect square.
-
A062722: a(n) = ceiling(n/3)*round(n/4).
-
A062724: a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.
-
A062725: Write 0, 1, 2, 3, 4, … in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, …
-
A062728: Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.
-
A062741: 3 times pentagonal numbers: 3*n*(3*n-1)/2.
-
A062748: Fourth column (r=3) of FS(3) staircase array A062745.
-
A062779: a(n) = 2*n*(2*n)!.
-
A062781: Number of arithmetic progressions of four terms and any mean which can be extracted from the set of the first n positive integers.
-
A062782: a(n) = (n^2)! / (n^n).
-
A062783: a(n) = 3*n*(4*n-1).
-
A062786: Centered 10-gonal numbers.
-
A062788: Squares of the form 5n*(n-1)+1.
-
A062814: a(n) = Sum_{i=0..n-1} i * (n - i)^(n - i).
-
A062815: a(n) = Sum_{i=1..n} i^(i+1).
-
A062873: Nearest integer to arithmetic mean of n! and n^n.
-
A062874: Integer part of arithmetic mean of n! and n^n.
-
A062935: Palindromes of the form n! + 1.
-
A062938: a(n) = n*(n+1)*(n+2)*(n+3)+1 = (n^2 + 3*n + 1)^2.
-
A062970: a(n) = 1 + Sum_{j=1..n} j^j.
-
A062971: a(n) = (2*n)^n.
-
A062988: a(n) = binomial(n+6,5) - 1.
-
A062989: a(n) = C(n+6, 6) - n - 1.
-
A062992: Row sums of unsigned triangle A062991.