Summary of block A065
Sequences in block A065
Section titled “Sequences in block A065”-
A065033: 1 appears three times, other numbers twice.
-
A065034: a(n) = Lucas(2*n) + 1.
-
A065035: a(n+1) = a(n)^2 + 3*a(n) + 1.
-
A065087: a(n) = A000166(n)*binomial(n+1,2).
-
A065097: a(n) = ((2n+1) + (2n-1) - 1)!/((2n+1)!*(2n-1)!).
-
A065100: a(n+2) = 9*a(n+1) - a(n), a(0) = 3, a(1) = 27.
-
A065101: a(0) = c, a(1) = p*c^3; a(n+2) = p*c^2*a(n+1) - a(n), for p = 3, c = 2.
-
A065102: a(0) = c, a(1) = p*c^3; a(n+2) = p*c^2*a(n+1) - a(n), for p = 2, c = 3.
-
A065113: Sum of the squares of the a(n)-th and the (a(n)+1)st triangular numbers (A000217) is a perfect square.
-
A065140: a(n) = 2^n*(2*n)!.
-
A065141: a(n) = (n+1)*2^n*(2*n)!.
-
A065142: a(n) = 2^n*(n+1)*(3*n)!.
-
A065164: Permutation t->t+1 of Z, folded to N.
-
A065165: Permutation t->t+2 of Z, folded to N.
-
A065168: Permutation t->t-1 of Z, folded to N.
-
A065186: a(1)=1, a(2)=3, a(3)=5, a(4)=2, a(5)=4; for n > 5, a(n) = a(n-5) + 5.
-
A065187: “Greedy Dragons” permutation of the natural numbers, inverse of A065186.
-
A065190: Self-inverse permutation of the positive integers: 1 is fixed, followed by an infinite number of adjacent transpositions (n n+1).
-
A065220: a(n) = Fibonacci(n) - n.
-
A065236: a(n) = (4*n)!*(n+1)!/(2*n)!.
-
A065251: Simple quasi-periodic sequence consisting of the terms 1, 0 and -1.
-
A065252: The sequence A065251 reduced modulo 3 (i.e., replace every -1 with 2).
-
A065261: The siteswap sequence (the deltas p[i]-i, i in ]-inf,+inf[, folded from Z to N, mapping 0->1, 1->2, -1->3, 2->4, -2->5, etc.) for A065260.
-
A065262: The nonpositive side (-1, -2, -3, …) of the site swap sequence A065261. The bisection of odd terms of A065261.
-
A065332: 3-smooth numbers in their natural position, gaps filled with 0.
-
A065333: Characteristic function of 3-smooth numbers, i.e., numbers of the form 2^i*3^j (i, j >= 0).
-
A065355: a(n) = n! - Sum_{k=0..n-1} k!.
-
A065363: Sum of balanced ternary digits in n. Replace 3^k with 1 in balanced ternary expansion of n.
-
A065397: Primes which have no representation p + k*(k+1) / 2, with p prime and k > 0: A000040-Complement of A065396.
-
A065401: Number of normal play partisan games born on or before day n.
-
A065402: Number of normal play partisan games born on day n.
-
A065410: Number of labeled, rooted, binary trees with internal nodes labeled from {1, …,n} and leaves labeled from {0,1} such that for any path from the root to a leaf, the internal nodes receive distinct labels. In other words, the number of decision trees on n Boolean variables.
-
A065423: Number of ordered length 2 compositions of n with at least one even summand.
-
A065440: a(n) = (n-1)^n.
-
A065475: Natural numbers excluding 2.
-
A065482: a(n) = round( 2^n/n ).
-
A065513: Number of endofunctions of [n] with a cycle a->b->c->a and for all x in [n], some iterate f^k(x)=a.
-
A065532: a(n) = 48*n^2 - 1.
-
A065535: Number of strongly perfect lattices in dimension n.
-
A065536: Number of strongly eutactic lattices in dimension n.
-
A065563: Product of three consecutive Fibonacci numbers.
-
A065565: a(n) = floor((5/4)^n).
-
A065583: Sum of numbers which in base n have (n-1) distinct nonzero digits.
-
A065603: Transposition diameter: maximal number of moves in an optimal sorting of n objects by moving blocks.
-
A065653: a(0) = 0, a(1) = 1, a(n) = a(n-2)*a(n-2) + 2 for n > 1.
-
A065705: a(n) = Lucas(10*n).
-
A065866: a(n) = n! * Catalan(n+1).
-
A065874: a(n) = (7^(n+1) - (-6)^(n+1))/13.
-
A065928: (x,y) = (a(n),a(n+1)) are the solutions of (t(x)+t(y))/(1+xy) = t(2) = 3, where t(n) denotes the n-th triangular number t(n) = n(n+1)/2.
-
A065961: a(n) = (3*n - 1)!*n/2.
-
A065991: Numbers k such that the first k base-4 digits of Pi expressed in decimal forms a prime.
-
A065993: Numbers k such that the first k base-6 digits of Pi (A004605) expressed in decimal forms a prime.