Summary of block A122
Sequences in block A122
Section titled “Sequences in block A122”-
A122004: Primes p that divide A123373(p-1).
-
A122012: G.f.: x^2*(3+3*x-2*x^2)/ ( (x^2-x-1) * (x^2+x-1)).
-
A122026: Least number m such that every tournament with at least m nodes contains the acyclic n-node tournament.
-
A122035: Primes p = Prime[m] such that polynomial (1 + Sum[x^Prime[k],{k,1,m}]) factors over the integers.
-
A122036: Odd abundant numbers (A005231) which are not in A136446, i.e., not sum of some of their proper divisors > 1.
-
A122039: Duplicate of A083706.
-
A122041: a(n) = 2*a(n-1) - 1 for n>1, a(1)=23.
-
A122046: Partial sums of floor(n^2/8).
-
A122047: Degree of the polynomial P(n,x), defined by a Somos-6 type sequence: P(n,x)=(x^(n-1)*P(n-1,x)*P(n-5,x) + P(n-2,x)*P(n-4,x))/P(n-6,x), initialized with P(n,x)=1 at n<0.
-
A122057: a(n) = (n+1)! * (H(n+1) - H(2)), where H(n) are the harmonic numbers.
-
A122059: Number of different polygonal knots with n straight line segments.
-
A122061: First pentagonal number, 2nd hexagonal number, 3rd heptagonal number, 4th octagonal number and then repeat the same pattern: 5th pentagonal, 6th hexagonal, 7th heptagonal, 8th octagonal, etc.
-
A122067: a(n) = 2^A014105(n).
-
A122069: a(n) = 3*a(n-1) + 9*a(n-2) for n > 1, with a(0)=1, a(1)=3.
-
A122074: a(0)=1, a(1)=6, a(n) = 7*a(n-1) - 2*a(n-2).
-
A122088: Add 10, subtract 5, add 10, subtract 5, ad infinitum.
-
A122112: a(n) = 4*a(n-2) - a(n-1), with a(0)=1, a(1)=-2.
-
A122117: a(n) = 3*a(n-1) + 4*a(n-2), with a(0)=1, a(1)=2.
-
A122120: a(n) = 4*a(n-1) + 9*a(n-2), for n>1, with a(0)=1, a(1)=3.
-
A122188: Triangle read by rows, formed from the coefficients of characteristic polynomials of the following sequence of matrices: 2 X 2 {{0, 1}, {1, 1}}, 3 X 3 {{0, 1, 0}, {0, 0, 1}, {1, 1, 1}}, 4 X 4 {{0, 1,0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 1, 1, 1}}, 5 X 5 {{0, 1, 0, 0, 0}, {0, 0, 1, 0, 0}, {0, 0, 0, 1, 0}, {0, 0, 0, 0, 1}, {1, 1, 1, 1, 1}}, …
-
A122197: Fractal sequence: count up to successive integers twice.
-
A122224: Length of the longest possible self avoiding path on the 2-dimensional square lattice such that the path fits into a circle of diameter n.
-
A122229: a(n) = A014486(A122228(n)).
-
A122273: a(n) is the smallest prime p such that p^4 divides the numerator of the Bernoulli number B(A122272(n)).
-
A122367: Dimension of 3-variable non-commutative harmonics (twisted derivative) of order n. The dimension of the space of non-commutative polynomials of degree n in 3 variables which are killed by all symmetric differential operators (where for a monomial w, d_{xi} ( xi w ) = w and d_{xi} ( xj w ) = 0 for i != j).
-
A122391: Dimension of 2-variable non-commutative harmonics (Hausdorff derivative). The dimension of the space of non-commutative polynomials in 2 variables which are killed by all symmetric differential operators (where for a monomial w, d_{xi} ( w ) = sum over all subwords of w deleting xi once).
-
A122434: Expansion of (1+x)^3/(1+x+x^2).
-
A122461: Repetitions of even numbers four times.
-
A122470: Two digit numbers generated from the set {2,3,4}.
-
A122471: a(n) = 7*a(n-1)-n for n> 0, a(0)=1.
-
A122491: a(n) = n * Fibonacci(n) - Sum_{i=0..n} Fibonacci(i).
-
A122551: Denominators of the coefficients of the series for InverseErf(x).
-
A122552: a(0)=a(1)=a(2)=1, a(n) = a(n-1) + a(n-2) + 2*a(n-3) for n > 2.
-
A122553: a(0)=1, a(n)=3 for n > 0.
-
A122554: Let S(1) = {1} and, for n>1 let S(n) be the smallest set containing x, 2x and x+2 for each element x in S(n-1). a(n) is the number of elements in S(n).
-
A122558: a(0)=1, a(1)=3, a(n) = 4*a(n-1) + 3*a(n-2) for n > 1.
-
A122562: a(n) = n^3 + 114 * n.
-
A122571: a(n) = 14*a(n-1) - a(n-2), with a(1) = a(2) = 1.
-
A122572: a(n) = -14*a(n-1) - a(n-2), with a(1) = a(2) = 1.
-
A122573: Expansion of x*(1 + x)*(1 - 3*x^2)/(1 - 4*x^2 + x^4).
-
A122586: Leading digit of n expressed in base 3.
-
A122587: Leading digit of n in base 4.
-
A122606: n^(n+1) mod 7.
-
A122649: Difference between the double factorial of the n-th nonnegative odd number and the double factorial of the n-th nonnegative even number.
-
A122650: Fibonacci numbers starting at F(23).
-
A122652: a(0) = 0, a(1) = 4; for n > 1, a(n) = 10*a(n-1) - a(n-2).
-
A122656: a(n) = n*floor(n/2)^2.
-
A122657: a(n) = if n mod 2 = 1 then (n^2-1)*n^3/4 else n^5/4.
-
A122658: a(n) = if n mod 2 = 1 then n^3*(n-1)^2/2 else n^5/2.
-
A122678: Invariant number of polygons of n-circum-C_5 H_5 systems.
-
A122679: Invariant number of internal vertices of n-circum-C_5 H_5 systems.
-
A122690: a(n) = 5*a(n-1) + 4*a(n-2) with a(0)=1, a(1)=4.
-
A122693: Bishops on an n X n board (see Robinson paper for details).
-
A122709: a(0)=1; thereafter a(n) = 9*n - 3.
-
A122743: Number of normalized polynomials of degree n in GF(2)[x,y].
-
A122746: G.f.: 1/((1-2*x)*(1-2*x^2)).
-
A122747: Bishops on an n X n board (see Robinson paper for details).
-
A122769: Numbers k such that k^2 is of the form 3*m^2 + 2*m + 1 (A056109).
-
A122770: Numbers k such that A056109(k) is a square.
-
A122797: A P_3-stuttered arithmetic progression with a(n+1) = a(n) if n is a triangular number, a(n+1) = a(n) + 1 otherwise.
-
A122800: A P_4-stuttered arithmetic progression with a(n+1)=a(n) if n is square, a(n+1)=a(n)+2 otherwise.
-
A122803: Powers of -2: a(n) = (-2)^n.
-
A122874: List of pairs n+7, 13-n, n >= 0.
-
A122876: a(0)=1, a(1)=1, a(2)=2, a(n) = a(n-1) - a(n-2) for n>2.
-
A122879: Periodic sequence of period 21.
-
A122883: The (1,3)-entry in the 3 X 3 matrix M^n, where M = [1,1,1 / 4,2,1 / 9,3,1].
-
A122884: a(n+1) = 4*a(n) + 11*a(n-1) - 2*a(n-3).
-
A122916: Minimum number of n-candidate full-rank-order ballots required to instantiate any tournament on n nodes (where A beats B in the tournament if and only if it does so in a majority of the ballots and we forbid pairwise ties).
-
A122931: Row sums of triangular array A122930.
-
A122958: a(0)=1, a(n) = 2 - 2^(n-1) for n>0.
-
A122959: a(0) = 1, a(n) = (-1)^n*(2-2^(n-1)) for n>0.
-
A122968: 27th powers: a(n) = n^27.
-
A122969: 28th powers: a(n) = n^28.
-
A122970: 29th powers: a(n) = n^29.
-
A122971: 30th powers: a(n) = n^30.
-
A122972: a(1) = 1, a(2) = 2; for n>2, a(n+1) = a(n)*(n-1) + a(n-1)*n.
-
A122973: Number of vertices on the surface of an icosahedron.
-
A122983: a(n) = (2 + (-1)^n + 3^n)/4.
-
A122994: a(n) = a(n-1)+9*a(n-2) initialized with a(0)=1, a(1)=3.
-
A122999: G.f.: 1/(1 - x - 25*x^2).