Summary of block A060
Sequences in block A060
Section titled “Sequences in block A060”-
A060001: a(n) = Fibonacci(n)!.
-
A060008: a(n) = 9*binomial(n,4) = 3n*(n-1)*(n-2)*(n-3)/8.
-
A060018: a(n) = floor(2*sqrt(n-2)).
-
A060022: Expansion of (1-x-x^N)/((1-x)(1-x^2)(1-x^3)…(1-x^N)) for N = 3.
-
A060071: Duplicate of A037205.
-
A060072: a(n) = (n^(n-1) - 1)/(n-1) for n>1, a(1) = 0.
-
A060073: a(n) = (n^(n-1)-1)/(n-1)^2.
-
A060079: Duplicate of A052502.
-
A060080: Scaled sums of squares.
-
A060106: Numbers that are congruent to {1, 4, 6, 9, 11} mod 12. The ebony keys on a piano, starting with A0 = the 0th key.
-
A060107: Numbers that are congruent to {0, 2, 3, 5, 7, 8, 10} mod 12. The ivory keys on a piano, start with A0 = the 0th key.
-
A060143: a(n) = floor(n/tau), where tau = (1 + sqrt(5))/2.
-
A060144: a(n) = floor(n/(1+tau)), or equivalently floor(n/(tau)^2), where tau is the golden ratio (A001622).
-
A060145: a(n) = floor(n/tau) - floor(n/(1 + tau)).
-
A060150: a(0) = 1; for n > 0, binomial(2n-1, n-1)^2.
-
A060153: Duplicate of A055010.
-
A060156: a(n) = floor(10^n/n).
-
A060160: a(n) = 2^n - 1 + Fibonacci(n-1)*2^(n+1).
-
A060161: a(n) = 2^n - 1 + 2*Fibonacci(n-1).
-
A060182: a(0) = 1, a(1) = 5, a(2) = 13; a(n) = 2*a(n-1) + 2, n > 2.
-
A060188: A column and diagonal of A060187.
-
A060195: a(n) = 8^(n-1)*(2^n - 1).
-
A060202: Let G = complete graph on 4 vertices, create the sequence G, L(G), L(L(G)), L(L(L(G))), … where each graph in this sequence is the line graph of the previous graph; a(n) is number of vertices of the n-th graph in this sequence.
-
A060242: a(n) = (2^n - 1)*(4^n - 1).
-
A060275: At least two ordered triples of positive numbers have sum n and equal products.
-
A060300: a(n) = (2*n*(n+1))^2.
-
A060340: Possible sizes of the torsion group of an elliptic curve over some quadratic extension of the rationals Q. This is the full sequence.
-
A060352: a(n) = n*3^n - 1.
-
A060354: The n-th n-gonal number: a(n) = n*(n^2 - 3*n + 4)/2.
-
A060365: Multiples of one thousand which are described by single words in American English.
-
A060366: Powers of one thousand which are described by single words in dated British English usage, extended by using “-ard” beyond 10^9.
-
A060377: Pepin’s test numbers.
-
A060407: Maximal number of pairwise edge-disjoint monochromatic K_3’s in a K_n for any 2-coloring of the edges of K_n.
-
A060416: a(n) = n*4^n - 1, with a(0) = 1.
-
A060423: Number of obtuse triangles made from vertices of a regular n-gon.
-
A060432: Partial sums of A002024.
-
A060453: Dot product of the squares and the quarter-squares: a(n) = sum(i=1..n, i^2 * floor(i^2/4)).
-
A060458: Maximum value seen in the final n decimal digits of 2^j for all values of j.
-
A060459: a(n) = (n*(n+1))^3.
-
A060460: Consider the final n decimal digits of 2^j for all values of j. They are periodic. Sequence gives position (or phase) of the maximal value seen in these n digits.
-
A060482: New record highs reached in A060030.
-
A060488: Number of 4-block ordered tricoverings of an unlabeled n-set.
-
A060494: a(n) = floor(n^4/64).
-
A060505: a(n) = floor(2^n/(n^2)).
-
A060510: Alternating with hexagonal stutters: if n is hexagonal (2k^2 - k, i.e., A000384) then a(n)=a(n-1), otherwise a(n) = 1 - a(n-1).
-
A060531: 9th binomial transform of (1,0,1,0,1,…), A059841.
-
A060541: a(n) = binomial(4*n, 4).
-
A060542: a(n) = (1/6)*multinomial(3*n;n,n,n).
-
A060544: Centered 9-gonal (also known as nonagonal or enneagonal) numbers. Every third triangular number, starting with a(1)=1.
-
A060546: a(n) = 2^ceiling(n/2).
-
A060576: a(n) = 1 except for a(1) = 0.
-
A060584: Compare ultimate and penultimate digits of n base 3, i.e., 0 if n mod 3 = floor(n/3) mod 3, 1 otherwise; also 0 if (n mod 9) is a multiple of 4, 1 otherwise.
-
A060588: If the final two digits of n written in base 3 are the same then this digit, otherwise mod 3-sum of these two digits.
-
A060589: a(n) = 2*(2^n-1)*3^(n-1).
-
A060590: Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.
-
A060593: a(n) is the number of ways that a cycle of length 2n+1 in the symmetric group S_(2n+1) can be decomposed as the product of two cycles of length 2n+1.
-
A060602: Number of tilings of the d-dimensional zonotope constructed from d+3 vectors.
-
A060612: Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=4 and D varies.
-
A060614: Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=5 and D varies.
-
A060616: Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=6 and D varies.
-
A060621: Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 3 and d varies.
-
A060626: Number of right triangles of a given area required to form successively larger squares.
-
A060644: a(n) = floor((n+1)^(n+1)/n^n).
-
A060645: a(0) = 0, a(1) = 4, then a(n) = 18*a(n-1) - a(n-2).
-
A060647: Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.
-
A060656: a(n) = 2*a(n-1)*a(n-2)/a(n-3), with a(0)=a(1)=1.
-
A060692: Number of parts if 3^n is partitioned into parts of size 2^n as far as possible and into parts of size 1^n.
-
A060706: For n >= 1 a(n) is the size of the conjugacy class in the symmetric group S_(4n) consisting of permutations whose cycle decomposition is a product of n disjoint 4-cycles.
-
A060722: a(n) = 3^(n^2).
-
A060728: Numbers n such that Ramanujan’s equation x^2 + 7 = 2^n has an integer solution.
-
A060747: a(n) = 2*n - 1.
-
A060757: a(n) = 4^(n^2).
-
A060758: a(n) = 5^(n^2).
-
A060759: a(n) = 7^(n^2).
-
A060760: a(n) = 8^(n^2).
-
A060761: a(n) = 9^(n^2).
-
A060762: Number of conjugacy classes (the same as the number of irreducible representations) in the dihedral group with 2n elements.
-
A060782: Degree of the curve C(n) relative to a triangle ABC with side lengths a, b and c, given by (x^n- b^n)(y^n-c^n)(z^n-a^n) = (x^n-c^n)(y^n-a^n)(z^n-b^n) where x, y and z denote the distances from the variable point to vertices A, B and C respectively.
-
A060783: Number of conics which pass through 3 points and are bitangent to a general curve of order n.
-
A060785: a(n) = 3*(n - 2)*(5*n -11).
-
A060787: a(n) = 18*(n - 2)*(2*n - 5).
-
A060788: a(n) = 9*(n-2)^2 * (n^2 - 2*n - 1).
-
A060798: Numbers k such that difference between the upper and lower central divisors of k is 1.
-
A060801: Invert transform of odd numbers: a(n) = Sum_{k=1..n} (2*k+1)*a(n-k), a(0)=1.
-
A060803: a(n) = Sum_{k=0..n} 2^(2^k).
-
A060806: Denominators of special continued fraction for 2*zeta(3).
-
A060816: a(0) = 1; a(n) = (5*3^(n-1) - 1)/2 for n > 0.
-
A060819: a(n) = n / gcd(n,4).
-
A060820: a(n) = (2*n-1)^2 + (2*n)^2.
-
A060834: a(n) = 6*n^2 + 6*n + 31.
-
A060851: a(n) = (2n-1) * 3^(2n-1).
-
A060858: “0303456”, a popular song by Rafaela Carra.
-
A060867: a(n) = (2^n - 1)^2.
-
A060868: Number of n X n matrices over GF(3) with rank 1.
-
A060869: Number of n X n matrices over GF(4) with rank 1.
-
A060870: Number of n X n matrices over GF(5) with rank 1.
-
A060871: Number of n X n matrices over GF(7) with rank 1.
-
A060883: a(n) = n^6 + n^3 + 1.
-
A060884: a(n) = n^4 - n^3 + n^2 - n + 1.
-
A060885: a(n) = Sum_{j=0..10} n^j.
-
A060886: a(n) = n^4 - n^2 + 1.
-
A060887: a(n) = Sum_{j=0..12} n^j.
-
A060888: a(n) = n^6 - n^5 + n^4 - n^3 + n^2 - n + 1.
-
A060889: a(n) = n^8 - n^7 + n^5 - n^4 + n^3 - n + 1.
-
A060890: a(n) = n^8 + 1.
-
A060891: a(n) = n^6 - n^3 + 1.
-
A060892: a(n) = n^8 - n^6 + n^4 - n^2 + 1.
-
A060893: a(n) = n^8 - n^4 + 1.
-
A060895: a(n) = n^16 + 1.
-
A060896: a(n) = n^12 - n^6 + 1.
-
A060919: Number of corners in a 4-sided fractal.
-
A060925: a(n) = 2*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 4.
-
A060946: Trace of Vandermonde matrix of numbers 1,2,…,n, i.e., the matrix A with A[i,j] = i^(j-1), 1 <= i <= n, 1 <= j <= n.
-
A060995: Number of routes of length 2n on the sides of an octagon from a point to opposite point.
-
A060999: Nearest integer to (n+1)^3/9.