Summary of block A064
Sequences in block A064
Section titled “Sequences in block A064”-
A064017: Number of ternary trees (A001764) with n nodes and maximal diameter.
-
A064038: Numerator of average number of swaps needed to bubble sort a string of n distinct letters.
-
A064043: Number of length 3 walks on an n-dimensional hypercubic lattice starting at the origin and staying in the nonnegative part.
-
A064046: Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part.
-
A064096: Fifth diagonal of triangle A064094.
-
A064099: a(n) = ceiling(log(3 + 2*n)/log(3)).
-
A064100: a(n) = n * (100^n - 1)/99.
-
A064108: a(n) = (20^n - 1)/19.
-
A064183: Define a pair of sequences by p(0) = 0, q(0) = p(1) = q(1) = 1, q(n+1) = p(n)*q(n-1), p(n+1) = q(n+1) + q(n) for n > 0; then a(n) = q(n) and A064526(n) = p(n).
-
A064199: a(n) = 9*(n-2)^2*(n^2-2*n-1)/2.
-
A064200: a(n) = 12*n*(n-1).
-
A064201: 9 times octagonal numbers: a(n) = 9*n*(3*n-2).
-
A064225: a(n) = (9*n^2 + 5*n + 2)/2.
-
A064226: a(n) = (9*n^2 + 13*n + 6)/2.
-
A064235: The smallest power of 3 that is greater than or equal to n.
-
A064263: a(n) = 11*n mod 30.
-
A064264: a(n) = 19*n mod 30.
-
A064306: Convolution of A052701 (Catalan numbers multiplied by powers of 2) with powers of -1.
-
A064322: Triply triangular numbers.
-
A064323: a(n) = a(n-1)+ceiling(a(n-2)/2) with a(0)=0, a(1)=1.
-
A064324: a(n) = a(n-1) + floor(a(n-2)/2) with a(0)=1, a(1)=2.
-
A064335: a(n) = 6*(2*n)!/(n+2).
-
A064350: a(n) = (3*n)!/n!.
-
A064352: a(n) = (3*n)!/(2*n)!.
-
A064374: Numbers k such that sigma(k) > phi(k)^2.
-
A064378: a(0) = 2, a(n) = 2^(n+1)*(n-1)! (n >= 1).
-
A064385: a(n) = 2*5^n - 3.
-
A064429: a(n) = floor(n / 3) * 3 + sign(n mod 3) * (3 - n mod 3).
-
A064434: a(n) = (2*a(n-1) + 1) mod n.
-
A064437: a(1)=1, a(n) = a(n-1) + 3 if n is already in the sequence, a(n) = a(n-1) + 2 otherwise.
-
A064455: a(2n) = 3n, a(2n-1) = n.
-
A064488: A Beatty sequence: Floor[n*c], where c = A064648 is the sum of the reciprocals of primorials.
-
A064513: Maximal number of nodes in graph of degree <= n and diameter 2 (another version).
-
A064551: Ado [Simone Caramel]‘s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.
-
A064583: a(n) = n^4*(n^4+1)*(n^2-1).
-
A064617: a(n) = (10^n - 1)*(80/81) + n/9.
-
A064628: a(n) = floor((4/3)^n).
-
A064629: a(n) = 4^n mod 3^n.
-
A064633: a(n) = 3^n*n!*(n+2)!/2!.
-
A064650: a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2.
-
A064651: a(n) = ceiling(a(n-1)/2) + a(n-2) with a(0)=0 and a(1)=1.
-
A064671: Number of n-digit base 4 biquanimous numbers (with leading 0’s allowed, but not all-0 string).
-
A064680: Halve every even number, double every odd number.
-
A064686: a(n) = number of n-digit base-3 biquams.
-
A064705: Maximal number of vectors u_1, u_2, … in R^n with |u_i| = 1 and |u_i - u_j| >= 1 for i, j distinct, where || is L1-norm.
-
A064717: A Beatty sequence for 2^i + 2^(-i) where i = sqrt(-1).
-
A064718: A Beatty sequence for 2^i + 2^-i where i = sqrt(-1).
-
A064746: a(n) = n*8^n + 1.
-
A064747: a(n) = n*9^n + 1.
-
A064748: a(n) = n*10^n + 1.
-
A064749: a(n) = n*11^n + 1.
-
A064750: a(n) = n*12^n + 1.
-
A064751: a(n) = n*5^n - 1.
-
A064752: a(n) = n*6^n - 1.
-
A064753: a(n) = n*7^n - 1.
-
A064754: a(n) = n*8^n - 1.
-
A064755: a(n) = n*9^n - 1.
-
A064756: a(n) = n*10^n - 1.
-
A064757: a(n) = n*11^n - 1.
-
A064758: a(n) = n*12^n - 1.
-
A064761: a(n) = 15*n^2.
-
A064762: a(n) = 21*n^2.
-
A064763: a(n) = 28*n^2.
-
A064773: Numbers k such that k^k + p(k) is prime.
-
A064796: Largest integer m such that every permutation (p_1, …, p_n) of (1, …, n) satisfies p_i * p_{i+1} >= m for some i, 1 <= i <= n, where p_{n+1} = p_1.
-
A064806: a(n) = n + digital root of n.
-
A064808: a(n) is the (n+1)st (n+2)-gonal number.
-
A064831: Partial sums of A001654, or sum of the areas of the first n Fibonacci rectangles.
-
A064842: Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, …, n}.
-
A064843: a(n) = A064842(n)/2.
-
A064847: Sequence a(n) such that there is a sequence b(n) with a(1) = b(1) = 1, a(n+1) = a(n) * b(n) and b(n+1) = a(n) + b(n) for n >= 1.
-
A064919: a(n) = Min { k | A064916(k) = n }.
-
A064994: A Beatty sequence from Khinchin’s constant (A002210).
-
A064995: A Beatty sequence from Khintchin’s constant (A002210).
-
A064996: A Beatty sequence: a(n) = floor(Pi^2 - 8).
-
A064997: A Beatty sequence: [Pi^2 -8].
-
A064999: Partial sums of sequence (essentially A002378): 1, 2, 6, 12, 20, 30, 42, 56, 72, 90, …