Programs for A150000A199999
List of integer sequences with links to LODA programs.
 A151374 (program): Number of walks within N^2 (the first quadrant of Z^2) starting at (0, 0), ending on the vertical axis and consisting of 2n steps taken from (1, 1), (1, 0), (1, 1) .
 A151542 (program): Generalized pentagonal numbers: a(n) = 12n + 3n*(n1)/2.
 A151566 (program): Leftist toothpicks (see Comments for definition).
 A151575 (program): G.f.: (1+x)/(1+x2*x^2).
 A151590 (program): Number of permutations of 3 indistinguishable copies of 1..n arranged in a circle with exactly 2 adjacent element pairs in decreasing order.
 A151666 (program): Number of partitions of n into distinct powers of 4.
 A151667 (program): Number of partitions of n into distinct powers of 5.
 A151670 (program): G.f.: Product_ k>=0 (1 + 2*x^(5^k)).
 A151674 (program): G.f.: Product_ k >= 0 (1 + 4*x^(5^k)).
 A151675 (program): Row sums of A154685.
 A151712 (program): a(n) = A048883(n) + 1.
 A151746 (program): G.f.: (12x5x^2+4x^3)/((14x)*(1x)^2).
 A151754 (program): Number of ndigit numbers that are divisible by 5^n.
 A151758 (program): G.f.: Theta^2Theta, where Theta = Sum_ k>=0 x^(2^k).
 A151763 (program): If n is a prime == 1 mod 4 then a(n) = 1, if n is a prime == 3 mod 4 then a(n) = 1, otherwise a(n) = 0.
 A151774 (program): Characteristic function of numbers with binary weight 2 (A018900).
 A151779 (program): a(1)=1; for n > 1, a(n)=6*5^ wt(n1)1 .
 A151780 (program): 5^ wt(n)1 .
 A151781 (program): Partial sums of A151779.
 A151782 (program): a(1)=1; for n > 1, a(n)=8*7^ wt(n1)1 .
 A151783 (program): a(n) = 4^ wt(n)1 .
 A151784 (program): 6^ wt(n)1 where wt(n) is the binary weight of n (A000120).
 A151785 (program): 7^ wt(n)1 where wt(n) is the binary weight of n (A000120).
 A151786 (program): a(n) = 8^(wt(n)1) where wt(n) is the binary weight of n (A000120).
 A151787 (program): a(1)=1; for n > 1, a(n)=3*2^ wt(n1)1 .
 A151788 (program): Partial sums of A151787.
 A151789 (program): a(1)=1; for n > 1, a(n)=5*4^ wt(n1)1 .
 A151790 (program): Partial sums of A151789.
 A151791 (program): a(1)=1; for n > 1, a(n) = 7*6^(wt(n1)1).
 A151792 (program): Partial sums of A151791.
 A151793 (program): Partial sums of A151782.
 A151794 (program): a(1)=2, a(2)=4, a(3)=6; a(n+3) = a(n+2)+ 2*a(n), n>=1.
 A151798 (program): a(0)=1, a(1)=2, a(n)=4 for n>=2.
 A151799 (program): Version 2 of the “previous prime” function: largest prime < n.
 A151800 (program): Least prime > n (version 2 of the “next prime” function).
 A151817 (program): a(n) = 2(2n)!/n!.
 A151819 (program): First component x of pairs (x,y) where x!+y! is a square, sorted on x.
 A151821 (program): Powers of 2, omitting 2 itself.
 A151842 (program): a(3n)=n, a(3n+1)=2n+1, a(3n+2)=n+1.
 A151889 (program): a(1)=2, a(2)=3; a(2k1)=2a(2k2)+a(2k3), a(2k)=3a(2k2)+2a(2k3), k >= 2.
 A151890 (program): Triangle read by rows: T(l,c) = 2lc + l + c (0 <= c <= l).
 A151898 (program): First differences of Frobenius numbers for 7 successive numbers A138987.
 A151899 (program): Period 6: repeat [0, 0, 1, 1, 1, 2].
 A151902 (program): a(n) = wt(k) + f(j) if n = 6k+j, 0 <= j < 6, where wt() = A000120(), f() = A151899().
 A151904 (program): a(n) = (3^(wt(k)+f(j))1)/2 if n = 6k+j, 0 <= j < 6, where wt = A000120, f = A151899.
 A151910 (program): First differences of A001682.
 A151914 (program): a(0)=0, a(1)=4; for n>=2, a(n) = (8/3)*(Sum_ i=1..n1 3^wt(i)) + 4, where wt() = A000120().
 A151915 (program): Wythoff AAAA numbers.
 A151917 (program): a(0)=0, a(1)=1; for n>=2, a(n) = (2/3)*(Sum_ i=1..n1 3^wt(i)) + 1, where wt() = A000120().
 A151920 (program): a(n) = (Sum_ i=1..n+1 3^wt(i))/3, where wt() = A000120().
 A151922 (program): Number of firstquadrant cells (including the two boundaries) that are “ON” after nth stage of the HolladayUlam cellular automaton.
 A151923 (program): A079316(2n+1).
 A151948 (program): a(n) = tau(sigma(phi(n))).
 A151949 (program): a(n) = image of n under the Kaprekar map n > (n with digits sorted into descending order)  (n with digits sorted into ascending order).
 A151961 (program): Semiperimeter of the nth Heronian triangle.
 A151970 (program): a(n) = smallest integer >= n which has only prime factors 3 and 5.
 A151971 (program): Numbers n such that n^2  n is divisible by 21.
 A151972 (program): Numbers that are congruent to 0, 1, 6, 10 mod 15.
 A151973 (program): Numbers n such that n^2  n is divisible by 24.
 A151974 (program): a(n) = n(n+1)(n+2)(n+3)(n+4)/8.
 A151976 (program): Minimal recursive sequence beginning with 5 similar to N with respect to property of integer to be or not to be in A079523.
 A151977 (program): Numbers that are congruent to 0, 1 mod 16.
 A151978 (program): Numbers that are congruent to 0, 1 mod 17.
 A151979 (program): Numbers congruent to 0, 1 mod 19.
 A151980 (program): Numbers n such that n^2  n is divisible by 20.
 A151981 (program): Numbers n such that n^2  n is divisible by 48.
 A151982 (program): Arrangement of Fibonaccinumbers in a centered triangular fashion, such that every number is the difference and/or sum of adjacent numbers.
 A151983 (program): Numbers congruent to 0, 1 mod 32.
 A151984 (program): Numbers that are congruent to 0, 1 mod 64.
 A151988 (program): G.f.: (x(x^4+1)(x^2x+1)(x^2+x+1))/((x^4+x^3+x^2+x+1)(x^4x^3+x^2x+1)*(x1)^2).
 A151989 (program): a(n) = A001512(n)/24 = (5n+1)(5n+2)(5n+3)(5*n+4)/24.
 A151997 (program): a(n) = (n 1’s followed by a 3)^2.
 A152009 (program): (L)sieve transform of 1,4,7,10,…,3n2,… (A016777)
 A152011 (program): a(0) = 1 and a(n) = (3^n  (1)^n)/2 for n >= 1.
 A152015 (program): a(n) = n^3  n^2  n.
 A152016 (program): a(n) = n^4  n^3  n^2  n.
 A152017 (program): a(n) = n^5n^4n^3n^2n.
 A152018 (program): Denominator of 1/n^21/(3n)^2 or of 8/(9n^2).
 A152020 (program): Denominator of 8/(9n^2) divided by 9.
 A152030 (program): a(n)=n^6n^5n^4n^3n^2n.
 A152031 (program): a(n) = n^5 + n^4 + n^3 + n^2 + n.
 A152032 (program): a(n) = 3/8+(3/8)(1)^n+((n+1)/4)(1)^(n+1)+((n+2)(n+1)/4)(1)^(n+2).
 A152035 (program): G.f.: (12x^2)/(12x2*x^2).
 A152041 (program): A008893/2.
 A152046 (program): a(n) = Product_ k=1..floor((n1)/2) (1 + 8cos(kPi/n)^2) for n >= 0.
 A152053 (program): a(n) = A144433(3n+1) + A144433(3n+2) + A144433(3n+3).
 A152064 (program): a(n) = 2n^3  3n^2 + 5.
 A152083 (program): Number of occurrences of “I” in all Roman numerals of numbers from 1 to n
 A152099 (program): Semiprimes based on powers of two and primes: a(n)=(2^Prime[n]  1)(2^Prime[n] + 1)=2^(2Prime[n])1.
 A152100 (program): G.f.: 1  2x(7  10*x + x^2)/(x  1)^4.
 A152101 (program): a(n)=16^n  32^(2n  1)  1.
 A152105 (program): a(n) = ((8 + sqrt4)^n + (8  sqrt4)^n)/2.
 A152106 (program): a(n) = (11^n + 7^n)/2.
 A152110 (program): G.f.: 2(2  11x  4*x^2 + x^3)/(x  1)^4.
 A152113 (program): A001333 with terms repeated.
 A152114 (program): Numbers a(n) are obtained by the application of an algorithm which is similar to sieve of Eratosthenes for A000045: retaining A000045(3)=2, we delete all multiples of 2, which are more than 2; retaining A000045(4)=3, we delete all multiples of 3, which are more than 3, etc.
 A152118 (program): a(n) = product( 4 +4cos(kPi/n)^2, k=1..(n1)/2 ).
 A152125 (program): Consider a square grid with side n consisting of n^2 cells (or points); a(n) is the minimal number of points that can be painted black so that, out of any four points forming a square with sides parallel to the sides of the grid, at least one of the four is black.
 A152132 (program): Maximal length of rook tour on an n X n+1 board.
 A152133 (program): Maximal length of rook tour on an n X n+2 board.
 A152134 (program): Maximal length of rook tour on an n X n+3 board.
 A152135 (program): Maximal length of rook tour on an n X n+4 board.
 A152152 (program): A sequence related to sine products and the Fibonacci numbers A000045: a(n) = Product_ k=1..n (1 + 4sin(2Pi*k/n)^2).
 A152161 (program): a(n) = 100n^2 + 100n + 21.
 A152163 (program): a(n) = a(n1)+a(n2), n>1 ; a(0)=1, a(1)=1.
 A152166 (program): a(2n) = 2^n; a(2n+1) = (2^(n+1)).
 A152174 (program): a(n) = 2a(n1)+4a(n2), n>1 ; a(0) = 1, a(1) = 4.
 A152179 (program): (n^22=A008865) mod 9. Period 9:repeat 8,2,7,5,5,7,2,8,7.
 A152198 (program): Triangle read by rows, A007318 rows repeated
 A152204 (program): Triangle read by rows: T(n,k) = 2n4k+5 (n >= 0, 1 <= k <= 1+floor(n/2)).
 A152205 (program): Triangle read by rows, A000012 * A152204.
 A152211 (program): a(n) = n * sigma_0(n) + sigma_1(n).
 A152223 (program): a(n) = 4a(n1) + 6a(n2) for n > 1 with a(0) = 1 and a(1) = 6.
 A152224 (program): a(n)=4a(n1)+6a(n2), n>1 ; a(0)=1, a(1)=6 .
 A152235 (program): Largest squarefree number dividing the number of divisors n.
 A152236 (program): A modulo two parity function as a triangle sequence: t(n,m)=Binomial[n,m]+p(n,m); Always even parity function: p(n,m)=If[Mod[Binomial[n, m], 2] == 0, Binomial[n, m], If[Mod[Binomial[ n, m], 2] == 1 && Binomial[n, m] > 1, 1 + Binomial[n, m], 0]].
 A152241 (program): Products of cubes of 2 successive primes.
 A152257 (program): a(n) = (3^n  1)^2*(3^n + 1)/16.
 A152268 (program): A hidden Markov recursion involving the matrices: M0 = 0, 1 , 1, 1/2 ; M = 0, 2 , 2, 1 ; as Mh=M0.M.(M0+I); v[(n)=Mh.v(n1): first element of v.
 A152271 (program): a(n)=1 for even n and (n+1)/2 for odd n.
 A152291 (program): a(n) = (n+1)^floor((n1)/2).
 A152298 (program): a(n) = (3^n1)/2 if n odd, (3^n1)/8 if n even.
 A152390 (program): Arises in enumerating nondegenerate colorings in Brook’s Theorem.
 A152417 (program): a(n) = (5^n  1)/(2^(3  (n mod 2))).
 A152418 (program): A sevens sequence: a(n)=(7^n  1)/(2^(4  3*Mod[n, 2])).
 A152422 (program): Decimal expansion of (sqrt(3)1)/2.
 A152423 (program): A variation of the Josephus problem, removing every other person, starting with person 1; a(n) is the last person remaining.
 A152424 (program): a[n_]:=IntegerPart[Prime[n^n]^(1/n)];
 A152429 (program): a(n) = (11^n + 5^n)/2.
 A152435 (program): a(n)=(11^n  1)/(52^(3  2Mod[n, 2])).
 A152436 (program): a(n)=(13^n  1)/(3*2^(3  Mod[n, 2])).
 A152438 (program): a(n)=(19^n  1)/(92^(3  2Mod[n, 2])).
 A152456 (program): a(n)=1(n+2)!2(n+1)!3*n!.
 A152457 (program): Partial sums of A027444.
 A152467 (program): a(n) = floor(n/6).
 A152524 (program): a(n) is the number of Lbit words in which, if up to k bits are perturbed, the resulting change in unsigned Lbit value is n, for L=8 and k=7.
 A152535 (program): a(n) = n*prime(n)  Sum_ i=1..n prime(i).
 A152551 (program): a(n) = (2*n+1)^floor((n1)/2).
 A152556 (program): a(n) = 2(2n+2)^floor((n1)/2).
 A152577 (program): a(n) = 10^(2*n  1) + 1.
 A152579 (program): a(n) = (10n+3)(10*n+17).
 A152596 (program): a(n) = 7a(n1)  6a(n2), n>1; a(0)=1, a(1)=3.
 A152599 (program): a(n)=10a(n1)12a(n2), n>1 ; a(0)=1, a(1)=4 .
 A152618 (program): a(n) = (n1)^2*(n+1).
 A152619 (program): n*(n+2)^2
 A152621 (program): a(n)=8a(n1)6a(n2), n>1 ; a(0)=1, a(1)=2.
 A152623 (program): Decimal expansion of 3/2.
 A152624 (program): Decimal expansion of 7/2.
 A152627 (program): Decimal expansion of 3/4.
 A152653 (program): a(n)=(n1)!*product((nk)!,k=1..n2).
 A152661 (program): Number of permutations of [n] for which the first two entries have the same parity (n>=2).
 A152669 (program): Last digit of Catalan number A000108(n).
 A152674 (program): Number of divisors of the numbers that are not squares.
 A152680 (program): a(n) = 4*A005098(n) = A002144(n)  1.
 A152684 (program): a(n) is the number of topdown sequences (F_1, F_2, …, F_n) whereas each F_i is a labeled forest on n nodes, containing i directed rooted trees. F_(i+1) is proper subset of F_i.
 A152689 (program): Apply partial sum operator thrice to factorials.
 A152690 (program): Partial sums of superfactorials (A000178).
 A152691 (program): Multiples of 64.
 A152692 (program): a(n) = n3^n  n2^n  n*1^n.
 A152714 (program): Triangle read by rows: T(n,k) = 3^min(k, nk).
 A152716 (program): Triangle T(n,k) read by rows: T(n,k) = 4^min(k, nk) = 4^A004197(n,k).
 A152717 (program): Triangle T(n,k) read by rows: T(n,k) = 5^min(k, nk) = 5^A004197(n,k).
 A152719 (program): Triangle read by rows: T(n,k) = A000129( 1 + min(k,nk) ), n>=0, 0<=k<=n.
 A152725 (program): a(n) = n(n+1)(n^4 + 2n^3  2n^2  3*n + 3)/2.
 A152726 (program): a(n) = n^7  (n1)^7 + (n2)^7  … + ((1)^n)*0^7.
 A152728 (program): a(n) + a(n+1) + a(n+2) = n^3.
 A152729 (program): a(n) = (n2)^4  a(n1)  a(n2), with a(1) = a(2) = 0.
 A152732 (program): a(n) + a(n+1) + a(n+2) = 2^n.
 A152733 (program): a(n) + a(n+1) + a(n+2) = 3^n.
 A152734 (program): 5 times pentagonal numbers: 5n(3*n1)/2.
 A152738 (program): a(n) = floor((n^2)/phi).
 A152740 (program): 11 times triangular numbers.
 A152741 (program): 13 times triangular numbers.
 A152742 (program): 13 times the squares: a(n) = 13*n^2.
 A152743 (program): 6 times pentagonal numbers: a(n) = 3n(3*n1).
 A152744 (program): 7 times pentagonal numbers: a(n) = 7n(3*n1)/2.
 A152745 (program): 5 times hexagonal numbers: 5n(2*n1).
 A152746 (program): Six times hexagonal numbers: 6n(2*n1).
 A152749 (program): a(n) = (n+1)(3n+1)/4 for n odd, a(n) = n(3n+2)/4 for n even.
 A152750 (program): Eight times hexagonal numbers: 8n(2*n1).
 A152751 (program): 3 times octagonal numbers: 3n(3*n2).
 A152752 (program): Terms of A118962 that are == 9 (mod 10).
 A152756 (program): Bisection of A000533.
 A152759 (program): 3 times 9gonal (or nonagonal) numbers: 3n(7n5)/2.
 A152760 (program): 4 times 9gonal numbers: a(n) = 2n(7*n5).
 A152764 (program): Bisection of A138144.
 A152767 (program): 3 times 10gonal (or decagonal) numbers: 3n(4n3).
 A152770 (program): Sum of proper divisors minus the number of proper divisors of n: a(n) = sigma(n)  n  d(n) + 1.
 A152771 (program): a(n) = sigma(n)  2*d(n) + 1.
 A152772 (program): a(n) = sigma(n)  3*d(n) + 3.
 A152773 (program): 3 times heptagonal numbers: a(n) = 3n(5n3)/2.
 A152775 (program): Numbers with 3n binary digits where every run length is 3, written in binary.
 A152776 (program): Numbers such that every run length in base 2 is 3.
 A152777 (program): 7 times heptagonal numbers: 7n(5*n3)/2.
 A152785 (program): a(n)=Floor[(n^2)/Catalan].
 A152811 (program): a(n) = 2(n^2 + 2n  2).
 A152813 (program): a(n) = 2n^2 + 10n + 3.
 A152815 (program): Triangle T(n,k), read by rows given by [1,0,1,0,0,0,0,0,0,…] DELTA [0,1,1,0,0,0,0,0,0,…] where DELTA is the operator defined in A084938.
 A152822 (program): Periodic sequence [1,1,0,1] of length 4.
 A152823 (program): Largest divisor < n of n^2 + 1, a(1) = 1.
 A152832 (program): a(0) = 2; a(n) = n  a(n1) for n > 0.
 A152833 (program): a(0) = 3; a(n) = na(n1).
 A152835 (program): a(0) = 22; a(n) = na(n1).
 A152855 (program): Periodic sequence [1,2,0,2,0] of period 5
 A152856 (program): Periodic sequence [4,0,4,3,4] of period 5
 A152857 (program): Periodic sequence [0,2,3,0,0] of period 5
 A152864 (program): Deficiency of n, plus the number of proper divisors of n: a(n) = 2n  sigma(n) + d(n)  1.
 A152875 (program): Number of permutations of 1,2,…,n (n >= 2) with all odd entries preceding all even entries or all even entries preceding all odd entries.
 A152881 (program): Positions of those 1’s that are followed by a 0, summed over all Fibonacci binary words of length n. A Fibonacci binary word is a binary word having no 00 subword.
 A152886 (program): Number of descents beginning and ending with an even number in all permutations of 1,2,…,n .
 A152887 (program): Number of descents beginning with an even number and ending with an odd number in all permutations of 1,2,…,n .
 A152889 (program): Periodic sequence [1,0,4,0,0] of period 5
 A152890 (program): Periodic sequence [4,1,4,0,1] of period 5
 A152891 (program): a(1) = b(1) = 0; for n > 1, b(n) = b(n1) + n1 + a(n1) and a(n) = a(n1) + n1 + b(n).
 A152892 (program): Periodic sequence [0,3,1,0,1] of period 5.
 A152893 (program): Periodic sequence [3, 3, 0, 0, 4] of period 5
 A152894 (program): Periodic sequence [0,0,1,4,0] of period 5.
 A152895 (program): Partial sums of A152891.
 A152896 (program): a=b=c=0;c(n)=c+n+a;b(n)=b+n+c;a(n)=a+n+b.
 A152897 (program): Partial sums of A152896.
 A152898 (program): Periodic sequence [1,4,0,0,0] of period 5
 A152904 (program): Triangle read by rows: T(n,k) = A008683(nk+1); 1<=k<=n; mu(n) “decrescendo”.
 A152906 (program): Irregular triangle read by rows, numbers in A007318 repeated three times .
 A152907 (program): Irregular triangle read by rows, numbers in A007318 repeated four times .
 A152915 (program): Exponacci (or exponential Fibonacci) numbers.
 A152917 (program): A000169 prefixed by an initial 0.
 A152919 (program): a(1)=1, for n>1, a(n) = n^2/4 + n/2 for even n, a(n) = n^2/4 + n  5/4 for odd n.
 A152947 (program): a(n) = 1 + (n2)*(n1)/2.
 A152948 (program): a(n) = (n^2  3*n + 6)/2.
 A152949 (program): a(n) = 3 + binomial(n1,2).
 A152950 (program): a(n) = 3 + n*(n1)/2.
 A152965 (program): Twice 12gonal numbers: a(n) = 2n(5*n4).
 A152966 (program): Twice repdigit numbers.
 A152967 (program): Partial sums of A152770.
 A152984 (program): Absolute values of A152864.
 A152985 (program): Sum of proper divisors minus the number of proper divisors of the square A000290(n).
 A152993 (program): a(n) = n  d(n)  pi(n) + 1.
 A152994 (program): Nine times hexagonal numbers: a(n) = 9n(2*n1).
 A152995 (program): Twice 11gonal numbers: a(n) = n(9n7).
 A152996 (program): 9 times pentagonal numbers: 9n(3*n1)/2.
 A152997 (program): Twice 13gonal numbers: a(n) = n(11n  9).
 A153010 (program): Indices of A153007 where the entry equals zero.
 A153026 (program): a(1)=0, a(n) = n^3  a(n1).
 A153036 (program): Integer parts of the full SternBrocot tree.
 A153037 (program): a(n) = 2n^2 + 16n + 23.
 A153056 (program): a(0)=2, a(n) = n^2+a(n1).
 A153057 (program): a(0)=3; a(n) = n^2 + a(n1) for n>0.
 A153058 (program): a(0)=4; a(n)=n^2+a(n1) for n>0.
 A153059 (program): a(0) = 0, a(n) = a(n1)^2  n.
 A153079 (program): a(n) = 13^n + 2.
 A153080 (program): a(n) = 13*n + 2.
 A153081 (program): Nonnegative numbers n such that 2n + 13 is prime.
 A153110 (program): Period 6: repeat [1, 5, 7, 2, 4, 8].
 A153111 (program): Solutions of the Pelllike equation 1 + 6AA = 7BB, with A, B integers.
 A153126 (program): Sums of rows of the triangle in A153125.
 A153127 (program): a(n) = (2n + 1)(5*n + 6).
 A153130 (program): Period 6: repeat [1, 2, 4, 8, 7, 5].
 A153134 (program): Numbers n such that 6n  7 is prime.
 A153143 (program): Nonnegative numbers n such that 2n + 19 is prime.
 A153151 (program): Rotated binary decrementing: For n<2 a(n) = n, if n=2^k, a(n) = 2*n1, otherwise a(n) = n1.
 A153152 (program): Rotated binary incrementing: For n<2 a(n)=n, if n=(2^k)1, a(n)=(n+1)/2, otherwise a(n)=n+1.
 A153153 (program): Permutation of natural numbers: A059893conjugate of A003188.
 A153154 (program): Permutation of natural numbers: A059893conjugate of A006068.
 A153169 (program): a(n) = 4n^2 + 12n + 3.
 A153173 (program): a(n) = L(5*n)/L(n) where L(n) = Lucas number A000204(n).
 A153183 (program): Numbers k such that 3k2 is prime.
 A153186 (program): Period 9: repeat 1,7,4,7,4,7,1,1,1.
 A153192 (program): Numbers such that the numerator of floor(sqrt(n))/n, when reduced to its lowest terms, is equal to 2.
 A153217 (program): a(n)=n^(n+3)(n+3)^n.
 A153218 (program): Numbers n such that 6n + 7 is prime.
 A153229 (program): a(0) = 0, a(1) = 1, and for n>=2, a(n) = (n1) * a(n2) + (n2) * a(n1).
 A153234 (program): a(n) = floor(2^n/9).
 A153237 (program): a(n) = A000079(n)  A153130(n).
 A153257 (program): a(n) = n^3(n+1)^2.
 A153258 (program): n^3  (n+2)^2.
 A153259 (program): a(n)=n^3(3*(n+3))^2.
 A153260 (program): a(n) = n^3  3*(n+3)^2.
 A153263 (program): A014217(n+3)  A014217(n).
 A153280 (program): Eigensequence of triangle A153279
 A153284 (program): a(n) = n + Sum_ j=1..n1 (1)^j * a(j) for n >= 2, a(1) = 1.
 A153285 (program): a(1)=1; for n > 1, a(n) = n^2 + Sum_ j=1..n1 (1)^j*a(j).
 A153286 (program): a(n) = n^3 + sum((1)^j*a(j)); for j=1 to n1; a(1)=1.
 A153287 (program): First differences of A152738.
 A153316 (program): Numerators of continued fraction convergents to sqrt(5/4).
 A153339 (program): Number of zigzag paths from top to bottom of a rectangle of width 5 with n rows whose color is that of the top right corner
 A153349 (program): Period 6: repeat [1, 7, 4, 4, 7, 1].
 A153355 (program): Numbers n such that 5n1 is a prime.
 A153365 (program): Number of zigzag paths from top to bottom of a rectangle of width 9 with 2n rows whose color is that of the top right corner.
 A153367 (program): Number of zigzag paths from top to bottom of a rectangle of width 9 with 2n1 rows whose color is not that of the top right corner.
 A153382 (program): a(n)=a(n1)+2a(n2)a(n3)a(n4), a(0)=0,a(1)=8,a(2)=10,a(3)=18.
 A153388 (program): Second bisection of A153382.
 A153448 (program): 3 times 12gonal (or dodecagonal) numbers: 3n(5*n4).
 A153449 (program): 11 times pentagonal numbers: 11n(3n1)/2.
 A153465 (program): 9*4^n  2.
 A153466 (program): a(n) = A027941(n) + A027941(n+6).
 A153480 (program): a(n) = 2*prime(n)^2  4.
 A153481 (program): a(n) = prime(n)^3  2.
 A153482 (program): a(n) = prime(n)^4  8.
 A153483 (program): a(n) = prime(n)^4  32.
 A153484 (program): a(n) = prime(n)^5  128.
 A153485 (program): Sum of all aliquot divisors of all positive integers <= n.
 A153486 (program): a(n) = prime(n)^6  512.
 A153491 (program): Triangle T(n,m)= 11*binomial(n,k)  8 read by rows, 0<=k<=n.
 A153509 (program): Period 9: repeat [6, 6, 6, 3, 3, 3, 0, 0, 0].
 A153511 (program): a(n) = 4 * A051189(n).
 A153638 (program): Odiousness of triangular numbers.
 A153639 (program): Evilness of triangular numbers.
 A153642 (program): a(n) = 4n^2 + 24n + 8.
 A153643 (program): Jacobsthal numbers A001045 incremented by 2.
 A153644 (program): a(n) = 4n^2 + 28n + 10.
 A153647 (program): a(n) = 3^n*(n + 2)!.
 A153703 (program): Partial sums of A069996.
 A153726 (program): Initial digit of Catalan number A000108(n).
 A153727 (program): Period 3: repeat [1, 4, 2] ; Trajectory of 3x+1 sequence starting at 1.
 A153733 (program): Remove all trailing ones in binary representation of n.
 A153762 (program): Numbers n such that 8n + 9 is prime.
 A153766 (program): Numbers n such that 8n9 is prime.
 A153772 (program): a(n) = (2^n + 2*(1)^n  6)/3.
 A153773 (program): a(2n) = 3a(2n1)  1, a(2n+1) = 3a(2n), with a(1)=1.
 A153774 (program): a(2n) = 3a(2n1), a(2n+1) = 3a(2n)  1, with a(1) = 1.
 A153775 (program): Sequence S such that 1 is in S and if x is in S, then 3x1 and 3x are in S.
 A153778 (program): Binary sequence constructed like a SternBrocot tree between 0 and 1, where XOR is applied instead of the mediant operation.
 A153780 (program): 10 times pentagonal numbers: a(n) = 5n(3*n1).
 A153783 (program): 3 times 11gonal (or hendecagonal) numbers: 3n(9*n7)/2.
 A153784 (program): 4 times heptagonal numbers: 2n(5n3).
 A153785 (program): 5 times heptagonal numbers: a(n) = 5n(5*n3)/2.
 A153786 (program): 6 times heptagonal numbers: a(n) = 3n(5*n3).
 A153792 (program): 12 times pentagonal numbers: a(n) = 6n(3*n1).
 A153793 (program): 13 times pentagonal numbers: a(n) = 13n(3*n1)/2.
 A153794 (program): 4 times octagonal numbers: a(n) = 4n(3*n2).
 A153795 (program): 5 times octagonal numbers: a(n) = 5n(3*n2).
 A153796 (program): 6 times octagonal numbers: a(n) = 6n(3*n2).
 A153797 (program): 7 times octagonal numbers: a(n) = 7n(3*n2).
 A153799 (program): Decimal expansion of 4  Pi.
 A153805 (program): Decimal expansion of 3e.
 A153808 (program): 8 times octagonal numbers: 8n(3*n2).
 A153814 (program): a(n) = 1001*n.
 A153819 (program): Linear recurrence with a(n) = 3a(n1)  a(n2) + 2 = 4a(n1)  4a(n2) + a(n3). Full sequence for A153466.
 A153848 (program): Repeat 21.
 A153873 (program): a(n) = 9*Fibonacci(2n+1)  1.
 A153875 (program): 3 times 13gonal (or tridecagonal) numbers: 3n(11*n  9)/2.
 A153881 (program): 1 followed by 1, 1, 1, … .
 A153893 (program): a(n) = 3*2^n  1.
 A153894 (program): a(n) = 5*2^n  1.
 A153972 (program): a(n) = 2^n + 6.
 A153973 (program): a(n) = 3a(n1)  2a(n2), with a(1) = 9, a(2) = 12.
 A153976 (program): a(n) = n^3 + (n+2)^3.
 A153977 (program): Onefourth of partial sums of A153976.
 A153978 (program): a(n) = n(n1)(n+1)(3n2)/12.
 A153981 (program): a(n) = 36Fibonacci(2n+1)  4.
 A153990 (program): Period 6: repeat [1, 2, 5, 4, 7, 8].
 A154021 (program): a(n+2) = 16*a(n+1)  a(n), with a(1)=0, a(2)=4.
 A154022 (program): a(n) = 5*A097780(n2).
 A154105 (program): a(n) = 12n^2 + 18n + 7.
 A154106 (program): a(n) = 12n^2 + 22n + 11.
 A154115 (program): Numbers n such that n + 3 is prime.
 A154117 (program): Expansion of (1  x + 3x^2)/((1x)(12*x)).
 A154118 (program): Expansion of (1  x + 5x^2)/((1x)*(12x)).
 A154127 (program): Period 6: repeat [1, 2, 5, 8, 7, 4].
 A154128 (program): a(n) = 5^n*(n+4)!/n!.
 A154141 (program): Indices k such that 8 plus the kth triangular number is a perfect square.
 A154149 (program): Indices k such that 22 plus the kth triangular number is a perfect square.
 A154222 (program): Row sums of number triangle A154221.
 A154244 (program): a(n) = 6a(n1)  2a(n2) for n>1; a(1)=1, a(2)=6.
 A154251 (program): Expansion of (1x+7x^2)/((1x)(12x)).
 A154252 (program): Expansion of (1x+8x^2)/((1x)(12x)) .
 A154254 (program): a(n) = 9n^2  8n + 2.
 A154260 (program): Numbers of the form m(4m + 1)/2.
 A154262 (program): a(n) = 9n^2  10n + 3.
 A154266 (program): a(n) = 27*n + 12.
 A154267 (program): a(n) = 27*n + 15.
 A154269 (program): Dirichlet inverse of A019590; Fully multiplicative with a(2^e) = (1)^e, a(p^e) = 0 for odd primes p.
 A154271 (program): Dirichlet inverse of A154272; Fully multiplicative with a(3^e) = (1)^e, a(p^e) = 0 for primes p <> 3.
 A154272 (program): 1,0,1 followed by 0,0,0,…
 A154277 (program): a(n) = 81n^2  72n + 17.
 A154281 (program): 1,0,0,1 followed by 0,0,0…
 A154282 (program): Dirichlet inverse of A154281.
 A154286 (program): a(n) = E(k)C(n+k,k) = Euler(k)binomial(n+k,k) for k=4.
 A154287 (program): (L)sieve transform of 1,4,9,16,…,n^2,… =A000290.
 A154292 (program): Integers of the form m(6m + 1)/2.
 A154293 (program): Integers of the form t/6, where t is a triangular number (A000217).
 A154295 (program): a(n) = 81n^2  90n + 26.
 A154306 (program): a(n) = (n+1)^3*(3+n)!/6.
 A154307 (program): a(n) = (n+1)^4*(4+n)!/24.
 A154322 (program): a(n) = 1 + n + binomial(n+3,5).
 A154323 (program): Central coefficients of number triangle A113582.
 A154325 (program): Triangle with interior all 2’s and borders 1.
 A154327 (program): Diagonal sums of number triangle A132046.
 A154333 (program): Difference between n^3 and the next smaller square
 A154355 (program): a(n) = 25n^2  36n + 13.
 A154357 (program): a(n) = 25n^2  14n + 2.
 A154358 (program): a(n) = 1250n^2  1800n + 649.
 A154359 (program): a(n) = 1250n^2  700n + 99.
 A154360 (program): a(n) = 250*n  180.
 A154361 (program): a(n) = 250*n  70.
 A154374 (program): a(n) = 1250n^2  100n + 1.
 A154375 (program): a(n) = 1250n^2 + 100n + 1.
 A154376 (program): a(n) = 25n^2  2n.
 A154377 (program): a(n) = 25n^2 + 2n.
 A154378 (program): a(n) = 250*n  10.
 A154379 (program): a(n) = 250*n + 10.
 A154383 (program): Powers of 4 at even indices, two times powers of 4 at odd indices.
 A154388 (program): Triangle T(n,k), 0<=k<=n, read by rows given by [0,1,1,0,0,0,0,0,0,0,…] DELTA [1,1,1,1,0,0,0,0,0,0,0,…] where DELTA is the operator defined in A084938.
 A154392 (program): Number of zeros of sin(x^2) in integer intervals starting with (0,1).
 A154407 (program): a(n) = 52^(n1) + 36^n/2.
 A154410 (program): a(n) = 5(36^n + 2^n)/2.
 A154514 (program): a(n) = 648n^2  72n + 1.
 A154515 (program): a(n) = 648n^2 + 72n + 1.
 A154516 (program): a(n) = 9n^2  n.
 A154517 (program): a(n) = 9*n^2 + n.
 A154518 (program): a(n) = 216*n  12.
 A154519 (program): a(n) = 216*n + 12.
 A154529 (program): A090040 mod 9.
 A154533 (program): Number of constants of the form a^3u + bc*v, where a, b, c are linear, u of order n3 and v of order n2.
 A154549 (program): a(n) = 111111*n.
 A154560 (program): (n+3)^2*n/2 + 1.
 A154571 (program): Numbers that are congruent to 0, 3, 4, 5, 7, 8 mod 12.
 A154575 (program): a(n) = 2n^2 + 12n + 4.
 A154576 (program): a(n) = 2n^2 + 14n + 5.
 A154589 (program): a(n)=A154570(n)+A154570(n+1).
 A154590 (program): 2n^2+16n+6.
 A154591 (program): a(n) = 2n^2 + 18n + 7.
 A154595 (program): Period 6: repeat [1, 3, 3, 1, 3, 3].
 A154599 (program): a(n) = 2n^2 + 20n + 8.
 A154600 (program): a(n) = 2n^2 + 22n + 9.
 A154607 (program): Numbers n such that 11*n + 4 is prime.
 A154609 (program): a(n) = 13*n + 5.
 A154610 (program): Numbers n such that 13n + 5 is prime.
 A154612 (program): 17n + 7.
 A154614 (program): Triangle read by rows where T(m,n) = m*n + m + n  1, 1<=n<=m.
 A154615 (program): a(n) = A022998(n)^2.
 A154617 (program): Eleven times hexagonal numbers: 11n(2*n1).
 A154626 (program): a(n) = 2^n*A001519(n).
 A154627 (program): Expansion of (15x)/(18x+4x^2).
 A154629 (program): Period 9: repeat [9, 3, 1, 3, 3, 1, 3, 9, 1].
 A154633 (program): a(n) = (4n+1)(4n+3)(4n+5)(4*n+7).
 A154687 (program): Period 6: repeat [1, 4, 7, 8, 5, 2].
 A154691 (program): Expansion of (1+x+x^2) / ((1xx^2)*(1x)).
 A154708 (program): Numbers a such that b and c exist with b <= a < c and a*(a+1) + b^2 = c^2.
 A154760 (program): Final digit of n!! (A006882).
 A154806 (program): Numbers such that every run length in base 2 is 4.
 A154808 (program): Numbers such that every run length in base 2 is 5.
 A154811 (program): a(n) = Fibonacci(2n+1) mod 9.
 A154815 (program): Period 6: repeat [8, 7, 4, 5, 2, 1].
 A154870 (program): Period 6: repeat [7, 5, 1, 7, 5, 1].
 A154890 (program): Jacobsthal numbers A001045 alternatingly incremented by 3 and 5.
 A154920 (program): Denominators of a ternary BBPtype formula for log(3).
 A154949 (program): Diagonal sums of Riordan array A154948.
 A154955 (program): a(1) = 1, a(2) = 1, followed by 0, 0, 0, … .
 A154957 (program): A symmetric (0,1)triangle.
 A154958 (program): Antidiagonal sums of number triangle A154957 regarded as a lower triangular infinite matrix.
 A154968 (program): a(n) = 4a(n1) + 12a(n2), n>2 with a(0)=1, a(1)=1, a(2)=7.
 A154990 (program): Triangle read by rows. Main diagonal is positive. The rest of the terms are negative.
 A154992 (program): A048473 prefixed by two zeros.
 A155013 (program): Integer part of square root of A000584.
 A155020 (program): a(n) = 2a(n1) + 2a(n2) for n>2, a(0)=1, a(1)=1, a(2)=3.
 A155038 (program): Triangle read by rows: T(n,k) is the number of compositions of n with first part k.
 A155040 (program): A symmetric (1,1)triangle.
 A155041 (program): Diagonal sums of symmetric (1,1)triangle A155040.
 A155043 (program): a(0)=0; for n >= 1, a(n) = 1 + a(nd(n)), where d(n) is the number of divisors of n (A000005).
 A155046 (program): List of pairs: first pair is (1,1); then follow (x,y) with (x+2y, x+y).
 A155050 (program): A symmetric Catalan based triangle.
 A155051 (program): Expansion of c(x^2)*(1+x)/(1x), c(x) the g.f. of A000108.
 A155067 (program): First differences of A031368.
 A155076 (program): Triangle read by rows. The main diagonal is positive. If rowindex >= 2*columnindex then 1 else 0.
 A155085 (program): a(n) = n + sum of divisors of n.
 A155086 (program): Numbers n such that n^2 == 1 (mod 13).
 A155091 (program): Triangle read by rows. Signed version of A145362. Main diagonal positive, rest of the nonzero terms negative.
 A155095 (program): Numbers k such that k^2 == 1 (mod 17).
 A155096 (program): Numbers k such that k^2 == 1 (mod 29).
 A155097 (program): Numbers k such that k^2 == 1 (mod 37).
 A155098 (program): Numbers k such that k^2 == 1 (mod 41).
 A155104 (program): Numbers appearing in the fourth column of A155103.
 A155107 (program): Numbers that are 23 or 30 (mod 53).
 A155110 (program): a(n) = 8*Fibonacci(2n+1).
 A155116 (program): a(n) = 3a(n1) + 3a(n2), n>2, a(0)=1, a(1)=2, a(2)=8.
 A155117 (program): a(n) = 4a(n1) + 4a(n2), n>2, a(0)=1, a(1)=3, a(2)=15.
 A155120 (program): a(n) = 2*(n^3 + n^2 + n  1).
 A155121 (program): a(n) = 2n(1 + n + n^2 + n^3)  3.
 A155122 (program): a(n) = 4(3n+2)(2n+1)(n+2)(n+1).
 A155124 (program): Triangle T(n, k) = 1n if k=0 else 2, read by rows.
 A155127 (program): a(n) = 6a(n1) + 6a(n2), n>2, a(0)=1, a(1)=5, a(2)=35.
 A155136 (program): Integers n such that n+28 is a square.
 A155148 (program): Numbers n such that n^4 has exactly 2 different decimal digits.
 A155155 (program): a(n) = 2(103^n  1).
 A155158 (program): Period 4: repeat [1, 5, 7, 3].
 A155159 (program): a(n) = 1 + 2nn!.
 A155160 (program): a(n) = 2^n * (n + 3)!!.
 A155167 (program): (L)sieve transform of A004767 = 3,7,11,15,…,4n1,… .
 A155179 (program): a(n)=4*a(n1)+a(n2), n>2; a(0)=1, a(1)=3, a(2)=12.
 A155195 (program): a(n)=6*a(n1)+a(n2), n>2 ; a(0)=1, a(1)=5, a(2)=30 .
 A155212 (program): a(n) = (n^2 + 9*n + 4)/2.
 A155213 (program): a(n) = floor(prime(n)/9).
 A155449 (program): Numbers k == 6 or 11 (mod 17).
 A155450 (program): Numbers equal to 5 or 18 mod 23.
 A155456 (program): Write (1+1/x)log(1+x) = Sum c(n)x^n; then a(n) = (n+1)!*c(n).
 A155457 (program): a(n) = exp(Lambda(n)), where Lambda(n) is the von Mangoldt function for odd (!) primes.
 A155461 (program): a(n) = n^2 + 52*n + 30.
 A155464 (program): a(n) = 7a(n1)  7a(n2) + a(n3) for n > 2; a(0) = 0, a(1) = 51, a(2) = 340.
 A155477 (program): a(n) = 43^(2*n+1).
 A155485 (program): a(n) = 5^n + (1  4^n)/3.
 A155498 (program): Number of odd digits in the concatenation of first n primes.
 A155499 (program): a(n) = n + (n+1)^(n+2).
 A155519 (program): a(n) = Sum (J(p): p is a permutation of 1,2,…,n ), where J(p) is the number of j <= ceiling(n/2) such that p(j) + p(n+1j) = n+1.
 A155539 (program): a(n) = n^(n+3) + (n+3)^n.
 A155543 (program): a(n)=2*A081294(n).
 A155557 (program): A proximateprime polynomial sequence generated by 2n^2  2n + 53089.
 A155559 (program): a(n) = 2*A131577(n).
 A155587 (program): Expansion of (1 + x*c(x))/(1  x), where c(x) is the g.f. of A000108.
 A155588 (program): a(n) = 5^n + 2^n  1^n.
 A155589 (program): 6^n+2^n1.
 A155590 (program): 7^n+2^n1^n.
 A155592 (program): 8^n+2^n1^n.
 A155593 (program): a(n) = 9^n + 2^n  1.
 A155594 (program): 10^n+2^n1.
 A155595 (program): 11^n+2^n1.
 A155596 (program): a(n) = 5^n  2^n + 1^n.
 A155597 (program): 6^n  2^n + 1.
 A155598 (program): 7^n2^n+1.
 A155599 (program): 8^n2^n+1^n
 A155600 (program): 9^n2^n+1^n
 A155601 (program): 10^n2^n+1^n
 A155602 (program): 4^n + 3^n  1.
 A155603 (program): a(n) = 5^n+3^n1.
 A155604 (program): 6^n+3^n1.
 A155605 (program): 7^n+3^n1.
 A155606 (program): a(n) = 8^n + 3^n  1.
 A155607 (program): 9^n+3^n1.
 A155608 (program): 10^n + 3^n  1.
 A155609 (program): a(n) = 4^n  3^n + 1.
 A155610 (program): 5^n  3^n + 1.
 A155611 (program): 6^n  3^n + 1.
 A155612 (program): 7^n  3^n + 1.
 A155613 (program): 8^n  3^n + 1.
 A155614 (program): 9^n  3^n + 1.
 A155615 (program): 10^n  3^n + 1.
 A155616 (program): 5^n + 4^n  1.
 A155617 (program): 6^n + 4^n  1.
 A155618 (program): a(n) = 7^n+4^n1^n.
 A155619 (program): 8^n+4^n1^n
 A155620 (program): 9^n+4^n1.
 A155621 (program): 10^n+4^n1^n
 A155622 (program): a(n) = 11^n  2^n + 1.
 A155623 (program): a(n) = 11^n + 3^n  1.
 A155624 (program): 11^n3^n+1.
 A155625 (program): 11^n+4^n1.
 A155626 (program): a(n) = 5^n4^n+1.
 A155627 (program): a(n) = 6^n  4^n + 1.
 A155628 (program): 7^n4^n+1^n
 A155629 (program): 8^n4^n+1^n
 A155630 (program): 9^n4^n+1^n
 A155631 (program): 10^n4^n+1^n
 A155632 (program): a(n) = 11^n  4^n + 1^n.
 A155633 (program): 6^n+5^n1.
 A155634 (program): 7^n + 5^n  1.
 A155635 (program): 8^n+5^n1.
 A155636 (program): 9^n+5^n1.
 A155637 (program): 10^n+5^n1.
 A155638 (program): 11^n+5^n1^n
 A155639 (program): 6^n5^n+1^n.
 A155640 (program): a(n) = 7^n  5^n + 1^n.
 A155641 (program): 8^n5^n+1^n.
 A155642 (program): 9^n  5^n + 1.
 A155643 (program): 10^n5^n+1.
 A155644 (program): 11^n5^n+1.
 A155645 (program): 7^n+6^n1.
 A155646 (program): 8^n + 6^n  1.
 A155647 (program): 9^n+6^n1^n
 A155648 (program): 10^n+6^n1^n
 A155649 (program): a(n) = 11^n+6^n1^n.
 A155650 (program): 7^n  6^n + 1.
 A155651 (program): 8^n6^n+1^n
 A155652 (program): 9^n6^n+1.
 A155653 (program): 10^n6^n+1.
 A155654 (program): 11^n  6^n + 1.
 A155655 (program): 8^n+7^n1^n.
 A155656 (program): 9^n+7^n1.
 A155657 (program): 10^n+7^n1.
 A155658 (program): a(n) = 11^n + 7^n  1.
 A155659 (program): 8^n7^n+1.
 A155660 (program): 9^n7^n+1.
 A155661 (program): 10^n7^n+1.
 A155662 (program): 11^n7^n+1.
 A155663 (program): 9^n+8^n1.
 A155664 (program): 10^n+8^n1
 A155665 (program): 11^n+8^n1.
 A155666 (program): 9^n8^n+1.
 A155667 (program): 10^n8^n+1.
 A155668 (program): 11^n8^n+1.
 A155669 (program): 10^n+9^n1.
 A155670 (program): 11^n+9^n1^n
 A155671 (program): a(n) = 10^n  9^n + 1^n.
 A155672 (program): 11^n9^n+1^n
 A155673 (program): 11^n+10^n1^n
 A155674 (program): 11^n10^n+1^n
 A155701 (program): a(n) = (4^n + 8)/3.
 A155721 (program): Positions of parity change in A033035.
 A155722 (program): Numbers k such that 2*k + 9 is prime.
 A155734 (program): Binomial transform of A154879.
 A155750 (program): First differences of A031215.
 A155753 (program): a(n) = (n^3  n + 9)/3.
 A155757 (program): (n^3  n + 15)/3.
 A155769 (program): a(n) = 2n^2 + 2n  41.
 A155794 (program): Triangle read by rows: t(n,m)=(m*(mn))!
 A155803 (program): A023001 interleaved with 2A023001 and 4A023001.
 A155836 (program): 2^(2^n) mod n.
 A155872 (program): a(n) = 10^n + 11^n.
 A155874 (program): Smallest positive composite number such that a(n)+n is also composite.
 A155875 (program): Smallest positive composite number such that a(n)  n is also composite.
 A155883 (program): a(n) = 14n^3  30n^2 + 24*n  7.
 A155902 (program): Arises in Connell’s game, a variation of Wythoff’s Nim game.
 A155912 (program): Let d(i) be the ith digit of the decimal expansion of Pi = 3.1415926535897932384626433832795…, so that d(0) = 3, d(1) = 1, d(2) = 4, etc. Then a(0) = 3, a(n) = d(d(n)) for n>0.
 A155919 (program): Number of squared hypotenuses mod n in three dimensions.
 A155934 (program): The sequence k(m) defined in A005991.
 A155937 (program): Numbers n such that 13*n + 8 is a prime.
 A155942 (program): Numbers n such that 16n+1 is a prime.
 A155944 (program): Jacobsthal numbers A001045, every second term incremented by 1.
 A155955 (program): Triangle read by rows: T(n,k) = (k*n)^k, 0 <= k <= n.
 A155956 (program): a(n) = Sum_ k=0..n (k*n)^k.
 A155957 (program): a(n) = (2*n^2)^n.
 A155965 (program): a(n) = n*(n^2+4).
 A155966 (program): a(n) = 2*n^2 + 8.
 A155972 (program): The Partition Ruler
 A155977 (program): a(n) = n^5 + n^3.
 A155988 (program): a(n) = (2n+1)9^n.
 A155996 (program): Nearest integer to 2^n*Pi/4.
 A156023 (program): n(n+1)/2  A112509(n)
 A156024 (program): n(n+1)/2  A156022(n)
 A156035 (program): Decimal expansion of 3 + 2*sqrt(2).
 A156037 (program): Largest nonprime < nth prime.
 A156039 (program): Number of compositions (ordered partitions) of n into 4 parts, where the first is at least as great as each of the others.
 A156040 (program): Number of compositions (ordered partitions) of n into 3 parts (some of which may be zero), where the first is at least as great as each of the others.
 A156060 (program): Jacobsthal numbers A001045 mod 9.
 A156084 (program): Sum of the squares of the first n Fibonacci numbers with index divisible by 3.
 A156085 (program): One fourth of the sum of the squares of the first n Fibonacci numbers with index divisible by 3.
 A156086 (program): Sum of the squares of the first n Fibonacci numbers with index divisible by 4.
 A156087 (program): One ninth of the sum of the squares of the first n Fibonacci numbers with index divisible by 4.
 A156094 (program): 5 F(2n) (F(2n)  1) + 1 where F(n) denotes the nth Fibonacci number.
 A156095 (program): 5 F(2n) (F(2n) + 1) + 1 where F(n) denotes the nth Fibonacci number.
 A156126 (program): Sequence related to Hankel transform of superballot numbers.
 A156127 (program): a(n) = 7*2^n  3.
 A156157 (program): a(n) = 6*a(n1)a(n2) for n > 2; a(1) = 17, a(2) = 85.
 A156161 (program): a(n) = 34*a(n1)a(n2)2312 for n > 2; a(1)=289, a(2)=7225.
 A156174 (program): Period 5: repeat [1,1,1,1,0].
 A156180 (program): Denominator of Euler(n,1/3).
 A156183 (program): Denominator of Euler(n, 1/5).
 A156189 (program): Denominator of Euler(n, 1/6).
 A156192 (program): Denominator of Euler(n, 1/7).
 A156194 (program): Period 12: 1,2,7,1,7,2,1,1,4,2,4,1 repeated.
 A156198 (program): a(n) = 2*a(n1)+3 with n>1, a(1)=8.
 A156199 (program): Period 12: repeat 1, 1, 4, 2, 4, 1, 1, 2, 7, 1, 7, 2 .
 A156202 (program): a(n)=2*a(n1)+3 with n>1, a(1)=10.
 A156203 (program): a(n) = 2*a(n1) + 3 for n>1, a(1)=14.
 A156207 (program): Sum of the products of the digits in n and their position m in n.
 A156218 (program): Denominator of Euler(n, 1/9).
 A156227 (program): Period 12: repeat [0,1,3,8,3,1,0,8,6,1,6,8].
 A156229 (program): Partial sums of A052343.
 A156230 (program): Sum of the products of the digits of n and the positions of the digits m in n starting from the last digit.
 A156232 (program): a(n) is the number of induced subgraphs with odd number of edges in the cycle graph C(n).
 A156260 (program): Row sums of A156254.
 A156276 (program): Denominator of Euler(n, 1/10).
 A156277 (program): Numbers appearing at every third row in the third column of A156241.
 A156279 (program): 4 times the Lucas number A000032(n).
 A156287 (program): Numbers k such that 4*k5 is a prime number.
 A156293 (program): Denominator of Euler(n, 1/11).
 A156296 (program): a(1)=1, a(n) = 2 * Sum_ k=1..n1 (3^k1)/2 * a(k) for n>=2.
 A156301 (program): a(n) = ceiling( n * (log_3 2)) = ceiling(n * 0.6309297535714574371…).
 A156319 (program): Triangle by columns: (1, 2, 0, 0, 0, …) in every column.
 A156331 (program): a(n)=8*A154811(n).
 A156339 (program): Denominator of Euler(n, 1/13).
 A156341 (program): Expansion of (26x)/(112x+11*x^2).
 A156359 (program): Denominator of Euler(n, 1/14).
 A156372 (program): Denominator of Euler(n, 1/15).
 A156376 (program): a(n) = 30*n + 19.
 A156531 (program): Denominator of Euler(n, 1/17).
 A156536 (program): Period length 12: repeat 7,5,1,1,5,7,7,5,1,1,5,7.
 A156550 (program): a(n) = 5(1)^nA078008(n).
 A156551 (program): Period 10: repeat [8,6,0,4,2,2,4,0,6,8].
 A156561 (program): Floor(Fibonacci(2n+1)/9).
 A156568 (program): a(n) = 6*a(n1)a(n2) for n > 2; a(1)=23, a(2)=115.
 A156573 (program): a(n) = 34*a(n1)a(n2)4232 for n > 2; a(1)=529, a(2)=13225.
 A156581 (program): Triangle T(n, k, m) = (m+2)^(k*(nk)) with m = 15, read by rows.
 A156589 (program): a(n) = 4^n  2^n  1.
 A156595 (program): Fixed point of the morphism 0>011, 1>010.
 A156605 (program): a(n) = (4^n + 20)/3.
 A156619 (program): Numbers congruent to 7, 18 mod 25.
 A156622 (program): Values of register a when register b becomes 0 for the tworegister machine i[1], i[1], i[1], d[2,1], d[1,6], i[2], d[1,5], d[2,3] .
 A156623 (program): Values of register b when register a becomes 0 for the two register machine i[1], i[1], i[1], d[2,1], d[1,6], i[2], d[1,5], d[2,3]
 A156627 (program): a(n) = 4394*n  1820.
 A156635 (program): 144*n^2  n.
 A156636 (program): a(n) = 4394*n + 1820.
 A156637 (program): Pell numbers A000129 mod 9. Period 24: repeat 0,1,2,5,3,2,7,7,3,4,2,8,0,8,7,4,6,7,2,2,6,5,7,1.
 A156638 (program): Numbers n such that n^2 + 2 == 0 (mod 9).
 A156639 (program): a(n) = 169n^2  140n + 29.
 A156640 (program): a(n) = 169n^2 + 140n + 29.
 A156641 (program): a(n) = 13*(100^(n+1)  1)/99.
 A156659 (program): Characteristic function of safe primes.
 A156660 (program): Characteristic function of Sophie Germain primes.
 A156661 (program): Denominator of Euler(n, 1/19).
 A156664 (program): Binomial transform of A052551.
 A156674 (program): Numbers k such that k^2  2 == 0 (mod 49).
 A156675 (program): a(n) = 17*((100^(n+1)  1)/99).
 A156676 (program): a(n) = 81n^2  44n + 6.
 A156677 (program): 81n^2  118n + 43.
 A156688 (program): The total number of distinct Pythagorean triples with an area numerically equal to n times their perimeters
 A156701 (program): a(n) = 4n^4 + 17n^2 + 4.
 A156706 (program): For all numbers k(n) congruent to +1 or 1 (mod 6) starting with k(n) = 5,7,11,13,… , a(k(n)) is the congruence (mod 6) if k(n) is prime and 0 if k(n) is composite.
 A156707 (program): For all numbers k(n) congruent to +1 or 1 (mod 4) starting with k(n) = 3,5,7,9,11,… , a(k(n)) is the congruence (mod 4) if k(n) is prime and 0 if k(n) is composite.
 A156709 (program): For all numbers k(n) congruent to 1 or +1 (mod 6) starting with k(n) = 5,7,11,13,… , a(k(n)) is incremented by the congruence (mod 6) if k(n) is prime and by 0 if k(n) is composite.
 A156711 (program): a(n) = 144n^2  161n + 45.
 A156712 (program): Star numbers (A003154) that are also triangular numbers (A000217).
 A156718 (program): Numbers k such that k^2 == 1 (mod 13^2).
 A156719 (program): a(n) = 144n^2  127n + 28.
 A156721 (program): a(n) = 57122n^2  47320n + 9801.
 A156734 (program): Square array read by antidiagonals up. T(n,k) = if k divides n then +1 else 1.
 A156735 (program): a(n) = 57122n^2 + 47320n + 9801.
 A156745 (program): a(n) = Sum_ k=1..n floor((n+k)/k) = n + Sum_ k=1..n sigma_0(k), where sigma_0(k) is A000005(k). Also a(n) = n + A006218(n).
 A156749 (program): For all numbers k(n) congruent to 1 or +1 (mod 4) starting with k(n) = 3,5,7,9,11,… , a(k(n)) is incremented by the congruence (mod 4) if k(n) is prime and by 0 if k(n) is composite.
 A156752 (program): a(n) = floor(Catalan(n+1)/Catalan(n)).
 A156755 (program): Period 9: repeat 1,1,2,1,1,2,2,2,3.
 A156760 (program): 5*4^n1.
 A156762 (program): Denominator of Euler(n, 1/21).
 A156769 (program): a(n) = denominator(2^(2n2)/factorial(2n1)).
 A156771 (program): a(n) = 729*n  531.
 A156772 (program): a(n) = 729*n  198.
 A156773 (program): a(n) = 6561n^2  9558n + 3482.
 A156774 (program): a(n) = 6561n^2  3564n + 485.
 A156778 (program): nA007504(n)/2 = n(sum of first n primes)/2
 A156795 (program): a(n) = 81*n  59.
 A156796 (program): a(n) = 81*n  22.
 A156797 (program): Numbers k such that k^2 + 2 == 0 (mod (9^2)).
 A156798 (program): a(n) = n^4 + 5*n^2 + 4.
 A156810 (program): a(n) = 225n^2  251n + 70.
 A156812 (program): a(n) = 225n^2  199n + 44.
 A156813 (program): a(n) = 225*n^2  n.
 A156814 (program): a(n) = 225*n^2 + n.
 A156821 (program): Prime factors of 13! listed with multiplicity.
 A156827 (program): A001792*A008683.
 A156828 (program): a(1) = 2. a(n) = the smallest prime >= a(n1) + 4.
 A156841 (program): 529n^2  312n + 46.
 A156842 (program): 529n^2  746n + 263.
 A156843 (program): 279841n^2  165048n + 24335.
 A156844 (program): 279841n^2  394634n + 139128.
 A156845 (program): 12167n  8579.
 A156846 (program): 12167n  3588.
 A156853 (program): 2025n^2  649n + 52.
 A156854 (program): 2025n^2  3401n + 1428.
 A156855 (program): 2025n^2  n.
 A156856 (program): 2025*n^2 + n.
 A156859 (program): The main column of a version of the square spiral.
 A156863 (program): Denominator of Euler(n, 1/22).
 A156865 (program): 729000n  612180.
 A156866 (program): 729000n  116820.
 A156867 (program): 729000n  180.
 A156868 (program): 729000n + 180.
 A156874 (program): Number of Sophie Germain primes <= n.
 A156875 (program): Number of safe primes <= n.
 A156892 (program): Denominator of Euler(n, 1/23).
 A156928 (program): G.f. of the z^1 coefficients of the FP1 in the second column of the A156921 matrix.
 A156934 (program): G.f. of the z^1 coefficients of the FP2 in the second column of the A156925 matrix
 A156965 (program): Denominator of Euler(n, 1/25).
 A157001 (program): Fractions x/y, with 1<=x,y<=n, that reduce to (odd)/(even).
 A157010 (program): a(n) = 1681n^2  756n + 85.
 A157014 (program): Expansion of x(1x)/(1  22x + x^2).
 A157024 (program): a(0)=1, a(n)=(3n1)3n(3n+1)/2 for n>0
 A157027 (program): Denominator of Euler(n, 1/26).
 A157040 (program): 121n^2  2n.
 A157052 (program): Number of integer sequences of length n+1 with sum zero and sum of absolute values 6.
 A157078 (program): 32805000n^2  55096200n + 23133601.
 A157079 (program): 32805000n^2  10513800n + 842401.
 A157080 (program): 32805000n^2  16200n + 1.
 A157081 (program): 32805000n^2 + 16200n + 1.
 A157084 (program): Consider all consecutive integer Pythagorean quintuples (X, X+1, X+2, Z1, Z) ordered by increasing Z; sequence gives X values.
 A157085 (program): Consider all Consecutive Integer Pythagorean quintuples (X, X+1, X+2, Z1, Z) ordered by increasing Z; sequence gives Z values.
 A157088 (program): Consider all consecutive integer Pythagorean septuples (X, X+1, X+2, X+3, Z2, Z1, Z) ordered by increasing Z; sequence gives X values.
 A157089 (program): Consider all Consecutive Integer Pythagorean septuples (X, X+1, X+2, X+3, Z2, Z1, Z) ordered by increasing Z; sequence gives Z values.
 A157092 (program): Consider all consecutive integer Pythagorean 9tuples (X, X+1, X+2, X+3, X+4, Z3, Z2, Z1, Z) ordered by increasing Z; sequence gives X values.
 A157093 (program): Consider all Consecutive Integer Pythagorean 9tuples (X,X+1,X+2,X+3,X+4,Z3,Z2,Z1,Z) ordered by increasing Z; sequence gives Z values.
 A157094 (program): Denominator of Euler(n, 1/27).
 A157097 (program): Consider all Consecutive Integer Pythagorean 11tuples (X, X+1, X+2, X+3, X+4, X+5, Z4, Z3, Z2, Z1, Z) ordered by increasing Z; sequence gives Z values.
 A157102 (program): Tuplechromatic Van der Waerden numbers.
 A157105 (program): 137842n  30996.
 A157106 (program): 5651522n^2  2541672n + 285769.
 A157110 (program): a(n) = 1681n^2  2606n + 1010.
 A157111 (program): a(n) = 137842*n  106846.
 A157112 (program): a(n) = 5651522n^2  8761372n + 3395619.
 A157122 (program): Decimal expansion of 11  3*sqrt(2).
 A157129 (program): An analog of the Kolakoski sequence A000002, only now a(n) = (length of nth run divided by 2) using 1 and 2 and starting with 1,1.
 A157130 (program): Partial sums of A128201.
 A157142 (program): Signed denominators of Leibniz series for Pi/4.
 A157195 (program): a(n) = 0 if n is 1 or a prime, otherwise a(n) = product of the proper divisors of n.
 A157201 (program): Numbers k such that 66*k + 1 is prime.
 A157240 (program): a(n) = A128018(n) + 1.
 A157241 (program): Expansion of x / ((1x)(4x^22*x+1)).
 A157252 (program): Denominator of Euler(n, 1/29).
 A157258 (program): Decimal expansion of 7 + 2*sqrt(2).
 A157259 (program): Decimal expansion of 7  2*sqrt(2).
 A157262 (program): a(n) = 36n^2  55n + 21.
 A157263 (program): a(n) = 1728*n  1320.
 A157264 (program): a(n) = 10368n^2  15840n + 6049.
 A157265 (program): a(n) = 36n^2  17n + 2.
 A157266 (program): a(n) = 1728*n  408.
 A157267 (program): a(n) = 10368n^2  4896n + 577.
 A157282 (program): Maximum cardinality of a weakly triplefree subset of 1, 2, …, n .
 A157286 (program): a(n) = 36*n^2  n.
 A157287 (program): a(n) = 1728*n  24.
 A157288 (program): a(n) = 10368n^2  288n + 1.
 A157319 (program): Possible total points for a single team in a game of American football, ignoring safeties (and time constraints).
 A157324 (program): a(n) = 36*n^2 + n.
 A157325 (program): a(n) = 1728*n + 24.
 A157326 (program): a(n) = 10368n^2 + 288n + 1.
 A157330 (program): a(n) = 64*n  8.
 A157331 (program): a(n) = 128n^2  32n + 1.
 A157335 (program): Expansion of 1/( (1+x)(17x+x^2) ).
 A157336 (program): a(n) = 8(8n + 1).
 A157337 (program): a(n) = 128n^2 + 32n + 1.
 A157362 (program): a(n) = 49n^2  2n.
 A157363 (program): 686n  14.
 A157364 (program): a(n) = 4802n^2  196n + 1.
 A157365 (program): a(n) = 49n^2 + 2n.
 A157366 (program): a(n) = 686*n + 14.
 A157367 (program): a(n) = 4802n^2 + 196n + 1.
 A157368 (program): a(n) = 49n^2  78n + 31.
 A157369 (program): a(n) = 343*n  273.
 A157370 (program): a(n) = 2401n^2  3822n + 1520.
 A157371 (program): a(n) = (n+1)(99n+5*n^2n^3).
 A157373 (program): a(n) = 49n^2  20n + 2.
 A157374 (program): a(n) = 343*n  70.
 A157375 (program): a(n) = 2401n^2  980n + 99.
 A157376 (program): a(n) = 6561n^2  7732n + 2278.
 A157377 (program): a(n) = 531441*n  313146.
 A157378 (program): a(n) = 43046721n^2  50729652n + 14945957.
 A157411 (program): a(n) = 30n^4  120n^3 + 120*n^2  19.
 A157416 (program): Length of maximal uncrossed cycle of knight moves on n X n board.
 A157423 (program): Triangle read by rows, T(n,k) = 0 if (nk+1) is prime, else 1.
 A157431 (program): a(n) = 4n^2 + 73n + 333.
 A157432 (program): 64n + 584.
 A157433 (program): 128n^2 + 2336n + 10657.
 A157434 (program): a(n) = 4n^2 + 79n + 390.
 A157435 (program): 64n + 632.
 A157436 (program): a(n) = 128n^2 + 2528n + 12481.
 A157440 (program): a(n) = 121n^2  204n + 86.
 A157441 (program): a(n) = 1331*n  1122.
 A157442 (program): a(n) = 14641n^2  24684n + 10405.
 A157443 (program): a(n) = 121n^2  38n + 3.
 A157444 (program): a(n) = 1331*n  209.
 A157445 (program): a(n) = 14641n^2  4598n + 362.
 A157446 (program): a(n) = 16*n^2  n.
 A157447 (program): a(n) = 512*n  16.
 A157448 (program): a(n) = 2048n^2  128n + 1.
 A157449 (program): Difference between n and the sum of its divisors except 1 and itself.
 A157454 (program): Triangle read by rows: T(n, m) = min(2m  1, 2(n  m) + 1).
 A157456 (program): Expansion of x(1x) / ( 1  16x + x^2 ).
 A157459 (program): Expansion of 72x^2 / (1323x+323*x^2x^3).
 A157460 (program): Expansion of 88x^2 / (1483x+483*x^2x^3).
 A157462 (program): Denominator of Euler(n, 1/30).
 A157474 (program): a(n) = 16n^2 + n.
 A157475 (program): 512n + 16.
 A157476 (program): 2048n^2 + 128n + 1.
 A157499 (program): Denominator of Euler(n, 1/31).
 A157502 (program): Even numbers without the squares.
 A157505 (program): a(n) = 1458*n + 18.
 A157506 (program): a(n) = 13122n^2 + 324n + 1.
 A157507 (program): a(n) = 81n^2  2n.
 A157508 (program): a(n) = 1458*n  18.
 A157509 (program): a(n) = 13122n^2  324n + 1.
 A157510 (program): a(n) = 1000*n + 20.
 A157511 (program): a(n) = 5000n^2 + 200n + 1.
 A157512 (program): Partial sums of A157502.
 A157514 (program): a(n) = 25*n^2  n.
 A157515 (program): a(n) = 1000*n  20.
 A157516 (program): a(n) = 5000n^2  200n + 1.
 A157517 (program): a(n) = 7 + 12n  6n^2.
 A157528 (program): Triangle read by rows: t(n,m) = 1 if n=m or m=1, otherwise t(n,m) = 2m(nm).
 A157532 (program): a(1) = 2; for n > 1, a(n) = 3.
 A157606 (program): a(1)=1. a(n) = the largest integer coprime to a(n1) and less than n^2.
 A157609 (program): 2662n  22.
 A157610 (program): 29282n^2  484n + 1.
 A157613 (program): a(n) = 2662*n + 22.
 A157614 (program): a(n) = 29282n^2 + 484n + 1.
 A157615 (program): On an n X n board, a(n) is the maximal number of squares covered by a selfavoiding path made of alternated vertical and horizontal unitary steps.
 A157616 (program): On an n X n board, a(n) is the maximal number of squares covered by a selfavoiding path that starts from a corner and is made of alternated vertical and horizontal unitary steps.
 A157617 (program): On an n X n board, a(n) is the maximal number of squares covered by a selfavoiding cycle made of alternated vertical and horizontal unit length steps.
 A157618 (program): a(n) = 625n^2  886n + 314.
 A157619 (program): 31250n  22150.
 A157620 (program): 781250n^2  1107500n + 392499.
 A157621 (program): 625n^2  364n + 53.
 A157622 (program): 31250n  9100.
 A157623 (program): 781250n^2  455000n + 66249.
 A157626 (program): 100n^2  151n + 57.
 A157627 (program): 8000n  6040.
 A157628 (program): 80000n^2  120800n + 45601.
 A157639 (program): Least number of lattice points from which every point of a square n X n lattice is visible.
 A157645 (program): A157644(n+39)A157644(n).
 A157651 (program): a(n) = 100n^2  49n + 6.
 A157652 (program): a(n) = 40(200n  49).
 A157653 (program): a(n) = 80000n^2  39200n + 4801.
 A157657 (program): a(1) = 1, a(n) = mu(n) for n >= 2.
 A157658 (program): a(1) = 0, a(n) = mu(n) for n >= 2.
 A157659 (program): a(n) = 100*n^2  n.
 A157660 (program): a(n) = 8000*n  40.
 A157661 (program): a(n) = 80000n^2  800n + 1.
 A157663 (program): a(n) = 8000*n + 40.
 A157664 (program): a(n) = 80000n^2 + 800n + 1.
 A157665 (program): a(n) = 729n^2  1016n + 354.
 A157666 (program): a(n) = 19683*n  13716.
 A157667 (program): a(n) = 531441n^2  740664n + 258065.
 A157668 (program): a(n) = 729n^2  442n + 67.
 A157669 (program): a(n) = 19683*n  5967.
 A157670 (program): a(n) = 531441n^2  322218n + 48842.
 A157671 (program): Numbers whose ternary representation begins with 2.
 A157681 (program): Fibonacci sequence beginning 29, 31.
 A157706 (program): The z^2 coefficients of the polynomials in the GF1 denominators of A156921.
 A157716 (program): Oneeighth of triangular numbers (integers only).
 A157725 (program): a(n) = Fibonacci(n) + 2.
 A157726 (program): a(n) = Fibonacci(n) + 3.
 A157727 (program): a(n) = Fibonacci(n) + 4.
 A157728 (program): a(n) = Fibonacci(n)  4.
 A157729 (program): a(n) = Fibonacci(n) + 5.
 A157730 (program): a(n) = 441n^2  488n + 135.
 A157731 (program): a(n) = 18522*n  10248.
 A157732 (program): a(n) = 388962n^2  430416n + 119071.
 A157734 (program): a(n) = 441n^2  394n + 88.
 A157735 (program): 18522n  8274.
 A157736 (program): a(n) = 388962n^2  347508n + 77617.
 A157737 (program): a(n) = 441n^2  2n.
 A157738 (program): 18522n  42.
 A157739 (program): a(n) = 388962n^2  1764n + 1.
 A157740 (program): 18522n + 42.
 A157741 (program): a(n) = 388962n^2 + 1764n + 1.
 A157742 (program): A006094(n+3) mod 9.
 A157757 (program): a(n) = 2809n^2  4618n + 1898.
 A157758 (program): a(n) = 297754*n  244754.
 A157759 (program): a(n) = 15780962n^2  25943924n + 10662963.
 A157760 (program): a(n) = 2809n^2  1000n + 89.
 A157761 (program): a(n) = 297754*n  53000.
 A157762 (program): a(n) = 15780962n^2  5618000n + 500001.
 A157768 (program): 27225n^2  39202n + 14112.
 A157769 (program): 8984250n  6468330.
 A157770 (program): 1482401250n^2  2134548900n + 768398401.
 A157786 (program): a(n) = 27225n^2  15248n + 2135.
 A157787 (program): 8984250n  2515920.
 A157788 (program): 1482401250n^2  830253600n + 116250751.
 A157792 (program): Least number of lattice points on one side from which every point of a square n X n lattice is visible.
 A157795 (program): Largest subset of the discrete triangular grid (a,b,c): a+b+c = n, a,b,c >= 0 that does not contain any upwardpointing triangles (i.e., triples (a+r,b,c), (a,b+r,c), (a,b,c+r) with r positive).
 A157796 (program): a(n) = 27225n^2  12098n + 1344.
 A157797 (program): a(n) = 8984250*n  1996170.
 A157798 (program): a(n) = 1482401250n^2  658736100n + 73180801.
 A157802 (program): a(n) = 27225n^2  51302n + 24168.
 A157803 (program): 8984250*n  8464830.
 A157804 (program): a(n) = 1482401250n^2  2793393900n + 1315947601.
 A157810 (program): Period 4: repeat [2, 1, 3, 2].
 A157814 (program): a(n) = 27225n^2  2n.
 A157815 (program): a(n) = 8984250*n  330.
 A157816 (program): a(n) = 1482401250n^2  108900n + 1.
 A157820 (program): 27225n^2 + 2n.
 A157821 (program): 8984250n + 330.
 A157822 (program): 1482401250n^2+108900n+1.
 A157823 (program): a(n) = A156591(n) + A156591(n+1).
 A157824 (program): 3600n^2  6751n + 3165.
 A157825 (program): 1728000n  1620240.
 A157826 (program): 103680000n^2  194428800n + 91152001.
 A157838 (program): 3600n^2  6049n + 2541.
 A157839 (program): 1728000n  1451760.
 A157840 (program): 103680000n^2  174211200n + 73180801.
 A157842 (program): a(n) = 3600n^2  5599n + 2177.
 A157843 (program): 1728000n  1343760.
 A157844 (program): 103680000n^2  161251200n + 62697601.
 A157845 (program): a(0) = 1, a(n) = sum of binary digits of all prior terms, expressed in binary.
 A157853 (program): 3600n^2  1601n + 178.
 A157854 (program): 1728000n  384240.
 A157855 (program): 103680000n^2  46108800n + 5126401.
 A157857 (program): a(n) = 3600*n^2  n.
 A157858 (program): a(n) = 1728000*n  240.
 A157859 (program): a(n) = 103680000n^2  28800n + 1.
 A157861 (program): a(n) = 3600*n^2 + n.
 A157862 (program): a(n) = 1728000*n + 240.
 A157863 (program): a(n) = 103680000n^2 + 28800n + 1.
 A157865 (program): a(n) is the number of numbers of the form 4n+2 in A082542.
 A157870 (program): a(n) = (4n+1)(4n+2) = (4n+2)!/(4n)!.
 A157872 (program): a(n) = 9*n^2  3.
 A157874 (program): Expansion of 104x^2 / (x^3+675x^2675*x+1).
 A157877 (program): Expansion of (1x)x/(x^230x+1).
 A157879 (program): Expansion of 120x^2 / (x^3+899x^2899*x+1).
 A157880 (program): Expansion of 136x^2 / (x^3+1155x^21155*x+1).
 A157881 (program): Expansion of 152x^2 / (x^3+1443x^21443*x+1).
 A157884 (program): For each positive integer m there exist at least one prime Q=Q(m) and at least one prime P=P(m) such that (2m1)^2 < Q < (2m)^2  (2m1) <= P < (2m)^2. Sequence lists pairs P(m), Q(m) for m >= 1. If more than one prime for P or Q exists, we take the smallest.
 A157887 (program): The domatic number of the ncube.
 A157888 (program): a(n) = 81*n^2 + 9.
 A157889 (program): a(n) = 18*n^2 + 1.
 A157892 (program): Values of k in A080075.
 A157893 (program): Values of m in A080075.
 A157909 (program): a(n) = 81*n^2  9.
 A157910 (program): a(n) = 18*n^2  1.
 A157912 (program): 64*n^2 + 16.
 A157913 (program): a(n) = 64*n^2  16.
 A157914 (program): a(n) = 8*n^2  1.
 A157915 (program): a(n) = 625*n^2 + 25.
 A157916 (program): a(n) = 50*n^2 + 1.
 A157918 (program): a(n) = 625*n^2  25.
 A157919 (program): a(n) = 50*n^2  1.
 A157921 (program): a(n) = 72*n  1.
 A157923 (program): a(n) = 49*n^2  n.
 A157924 (program): a(n) = 98*n  1.
 A157928 (program): a(n) = 0 if n < 2, = 1 otherwise.
 A157932 (program): Numbers k such that (3^(35k) + 5^(21k) + 7^(15*k)) mod 105 is prime.
 A157947 (program): a(n) = 98n + 1.
 A157948 (program): a(n) = 64*n^2  n.
 A157949 (program): a(n) = 128*n  1.
 A157951 (program): a(n) = 128*n + 1.
 A157952 (program): a(n) = 162*n + 1.
 A157953 (program): a(n) = 81n^2  n.
 A157954 (program): 162n  1.
 A157955 (program): 200n  1.
 A157956 (program): a(n) = 200*n + 1.
 A157958 (program): a(n) = 242*n + 1.
 A157960 (program): a(n) = 121*n^2  n.
 A157961 (program): a(n) = 242*n  1.
 A157966 (program): Number of 3’s in A157733(n).
 A157983 (program): a(n)=3!n!/(8!19!)
 A157984 (program): a(n) = n!/(7 * 20!).
 A157988 (program): a(n)=16n!/(25343!).
 A157990 (program): a(n) = 288*n + 1.
 A157996 (program): Primes which are sum of 1 and two nonconsecutive primes p1 and p2, p2  p1 > 2.
 A157997 (program): 288n  1.
 A157998 (program): 169n^2  n.
 A157999 (program): 338n  1.
 A158000 (program): a(n) = 338*n + 1.
 A158002 (program): a(n) = 392*n + 1.
 A158003 (program): a(n) = 196*n^2  n.
 A158004 (program): a(n) = 392*n  1.
 A158010 (program): a(n) = 256*n^2  n.
 A158011 (program): a(n) = 512n  1.
 A158037 (program): A106044 sorted and duplicates removed.
 A158038 (program): Difference between nth prime and next cube.
 A158056 (program): a(n) = 16n^2 + 2n.
 A158057 (program): First differences of A051870: 16*n + 1.
 A158058 (program): a(n) = 16n^2  2n.
 A158060 (program): 25n + 1.
 A158062 (program): a(n) = 36n^2  2n.
 A158064 (program): a(n) = 36n^2 + 2n.
 A158065 (program): a(n) = 36*n + 1.
 A158066 (program): a(n) = 49*n + 1.
 A158067 (program): a(n) = 64n^2  2n.
 A158068 (program): Period 6: repeat [1, 2, 2, 1, 5, 5].
 A158070 (program): a(n) = 64n^2 + 2n.
 A158071 (program): a(n) = 64*n + 1.
 A158083 (program): a(n) = Fibonacci(n+3) for n < 5 and 9*n  15 otherwise.
 A158090 (program): Period 9: repeat [0, 6, 0, 6, 0, 0, 3, 3, 0].
 A158111 (program): E.g.f.: sm^1(x) = Sum_ n>=0 a(n)*x^(3n+1)/(3n+1)!; a(n) = coefficient of x^(3n+1)/(3n+1)! in the Maclaurin expansion of the inverse of the Dixon elliptic function sm(x,0).
 A158116 (program): Triangle T(n,k) = 6^(k*(nk)), read by rows.
 A158117 (program): Triangle T(n, k) = 10^(k*(nk)), read by rows.
 A158121 (program): Given n points in the complex plane, let M(n) the number of distinct Moebius transformations that take 3 distinct points to 3 distinct points. Note that the triples may have some or all of the points in common.
 A158123 (program): a(n) = 81*n + 1.
 A158127 (program): a(n) = 100n^2 + 2n.
 A158128 (program): 100n + 1.
 A158129 (program): 100n^2  2n.
 A158130 (program): 121n  1.
 A158131 (program): 121n + 1.
 A158132 (program): 144n^2 + 2n.
 A158133 (program): 144n + 1.
 A158135 (program): a(n) = 144n^2  2n.
 A158136 (program): a(n) = 144*n  1.
 A158137 (program): Period 9: repeat [2,4,2,4,2,2,1,1,2].
 A158186 (program): a(n) = 10n^2  7n + 1.
 A158187 (program): a(n) = 10*n^2 + 1.
 A158218 (program): 169n^2  2n.
 A158219 (program): 169n  1.
 A158220 (program): a(n) = 169n^2 + 2n.
 A158221 (program): a(n) = 169n + 1.
 A158222 (program): a(n) = 196n^2 + 2n.
 A158223 (program): a(n) = 196*n + 1.
 A158224 (program): a(n) = 196n^2  2n.
 A158225 (program): 196n  1.
 A158226 (program): 225n^22n.
 A158227 (program): 225n  1.
 A158228 (program): 225n^2 + 2n.
 A158229 (program): 225n + 1.
 A158230 (program): 256n^2+2n.
 A158231 (program): a(n) = 256*n + 1.
 A158249 (program): 256n^2  2n.
 A158250 (program): 256n  1.
 A158252 (program): 289n^2  2n.
 A158253 (program): 289n  1.
 A158254 (program): 289n^2 + 2n.
 A158255 (program): 289n + 1.
 A158270 (program): Singledigit numbers in A061049.
 A158271 (program): 324n^2 + 2n.
 A158272 (program): 324n + 1.
 A158289 (program): Period 18 zigzag sequence: repeat [0,1,2,3,4,5,6,7,8,9,8,7,6,5,4,3,2,1].
 A158302 (program): “1” followed by repeats of 2^k deleting all 4^k, k>0
 A158305 (program): 324n^2  2n.
 A158306 (program): 324n  1.
 A158307 (program): 361n^2  2n.
 A158308 (program): 361n  1.
 A158309 (program): 361n^2 + 2n.
 A158310 (program): 361n + 1.
 A158312 (program): 400n^2 + 2n.
 A158313 (program): a(n) = 400 * n + 1.
 A158316 (program): 400n^2  2n.
 A158317 (program): a(n) = 400*n  1.
 A158319 (program): 441n  1.
 A158321 (program): a(n) = 441n^2 + 2n.
 A158322 (program): a(n) = 441*n + 1.
 A158325 (program): a(n) = 484n^2 + 2n.
 A158326 (program): 484n + 1.
 A158329 (program): 484n^2  2n.
 A158330 (program): 484n  1.
 A158333 (program): Position of number of digits increment in the sequence of powers of 3.
 A158362 (program): a(n)=binomial((n+1)^3,n+2), n=1,2… .
 A158363 (program): a(n)=binomial((n+2)^3,n+1),n=0,1… .
 A158364 (program): 529n^2  2n.
 A158365 (program): 529n  1.
 A158367 (program): 529n^2 + 2n.
 A158368 (program): 529n + 1.
 A158369 (program): 576n^2 + 2n.
 A158370 (program): 576n + 1.
 A158371 (program): 576n^2  2n.
 A158372 (program): 576n  1.
 A158373 (program): 625n^2  2n.
 A158374 (program): 625n  1.
 A158378 (program): a(1) = 0, a(n) = gcd(A051904(n), A051903(n)) for n >= 2.
 A158382 (program): a(n) = 625n^2 + 2n.
 A158383 (program): 625n + 1.
 A158385 (program): 676n^2 + 2n.
 A158386 (program): 676n + 1.
 A158387 (program): a(n) = 1 if n is a square, 1 if n is not a square.
 A158388 (program): 1 followed by infinitely many 1’s.
 A158392 (program): 676n^2  2n.
 A158393 (program): 676n  1.
 A158394 (program): 729n^2  2n.
 A158395 (program): 729n  1.
 A158396 (program): 729n^2 + 2n.
 A158397 (program): 729n + 1.
 A158398 (program): 784n^2  2n.
 A158399 (program): 784n  1.
 A158401 (program): a(n) = 841n^2  2n.
 A158402 (program): a(n) = 841*n  1.
 A158403 (program): 841n^2 + 2n.
 A158404 (program): 841n + 1.
 A158405 (program): Triangle T(n,m) = 1+2*m of odd numbers read along rows, 0<=m<n.
 A158406 (program): a(n) = 900n^2 + 2n.
 A158407 (program): a(n) = 900*n + 1.
 A158408 (program): a(n) = 900n^2  2n.
 A158409 (program): a(n) = 900*n  1.
 A158410 (program): 961n^2  2n.
 A158411 (program): Maximum number of colors required to paint a map having n regions.
 A158412 (program): 961n  1.
 A158413 (program): 961n^2 + 2n.
 A158414 (program): 961n + 1.
 A158416 (program): Expansion of (1+xx^3)/(1x^2)^2.
 A158420 (program): 1024n^2  2n.
 A158421 (program): 1024n  1.
 A158440 (program): Triangle T(n,k) read by rows: row n contains n times n+1 followed by n 1’s.
 A158443 (program): 16n^2  4.
 A158444 (program): a(n) = 16*n^2 + 4.
 A158445 (program): 25n^2 + 5.
 A158446 (program): 25n^2  5.
 A158447 (program): a(n) = 10*n^2  1.
 A158455 (program): a(n) = 2^(n1)(n1)!(4*n+1).
 A158459 (program): Period 4: repeat [0, 3, 2, 1].
 A158462 (program): a(n) = 36*n^2  6.
 A158463 (program): a(n) = 12*n^2  1.
 A158478 (program): Number of colors needed to paint n sectors of a circle.
 A158479 (program): 36n^2 + 6.
 A158480 (program): a(n) = 12*n^2 + 1.
 A158481 (program): 49n^2 + 7.
 A158482 (program): a(n) = 14*n^2 + 1.
 A158484 (program): 49n^2  7.
 A158485 (program): a(n) = 14*n^2  1.
 A158487 (program): a(n) = 64*n^2  8.
 A158488 (program): a(n) = 64*n^2 + 8.
 A158490 (program): 100n^2  10.
 A158491 (program): 20n^2  1.
 A158492 (program): a(n) = 100*n^2 + 10.
 A158493 (program): a(n) = 20*n^2 + 1.
 A158496 (program): Expansion of (14x+x^2)/(1+x^2)^2.
 A158498 (program): a(n) = (1/2)(n^3  6n^2 + 13*n  6).
 A158500 (program): Expansion of (1+sqrt(1+4x))(1+2x)/(2sqrt(1+4x)).
 A158515 (program): Number of colors needed to paint a wheel graph on n nodes.
 A158525 (program): Number of connected spanning subgraphs and number of forests of the wheel graph W_n.
 A158536 (program): 121n^2 + 11.
 A158537 (program): a(n) = 22*n^2 + 1.
 A158539 (program): a(n) = 121*n^2  11.
 A158540 (program): a(n) = 22*n^2  1.
 A158543 (program): a(n) = 144*n^2  12.
 A158544 (program): a(n) = 24*n^2  1.
 A158546 (program): a(n) = 144*n^2 + 12.
 A158547 (program): a(n) = 24*n^2 + 1.
 A158548 (program): a(n) = 169*n^2 + 13.
 A158549 (program): a(n) = 26*n^2 + 1.
 A158550 (program): a(n) = 169*n^2  13.
 A158551 (program): a(n) = 26*n^2  1.
 A158552 (program): a(n) = A144433(n)  A106833(n).
 A158553 (program): a(n) = 196*n^2  14.
 A158554 (program): a(n) = 28*n^2  1.
 A158555 (program): a(n) = 196*n^2 + 14.
 A158556 (program): a(n) = 28*n^2 + 1.
 A158557 (program): a(n) = 225*n^2 + 15.
 A158558 (program): a(n) = 30n^2 + 1.
 A158559 (program): a(n) = 225*n^2  15.
 A158560 (program): a(n) = 30n^2  1.
 A158561 (program): a(n)=((2^n)((2^n)+1)  (2^(n1))((2^(n1))+1))/2, a(1)=3.
 A158562 (program): a(n) = 256*n^2  16.
 A158563 (program): a(n) = 32*n^2  1.
 A158569 (program): a(n) = Sum_ i=1..F(n) F(i), n >= 1, where F(k) is A000045, Fibonacci numbers.
 A158573 (program): Numbers k such that 30*k + 7 is prime.
 A158574 (program): a(n) = 256*n^2 + 16.
 A158575 (program): a(n) = 32*n^2 + 1.
 A158585 (program): a(n) = 289*n^2 + 17.
 A158586 (program): a(n) = 34*n^2 + 1.
 A158587 (program): a(n) = 289*n^2  17.
 A158588 (program): a(n) = 34*n^2  1.
 A158589 (program): a(n) = 324*n^2  18.
 A158590 (program): a(n) = 324*n^2 + 18.
 A158591 (program): a(n) = 36*n^2 + 1.
 A158592 (program): a(n) = 361*n^2 + 19.
 A158593 (program): a(n) = 38*n^2 + 1.
 A158595 (program): a(n) = 361*n^2  19.
 A158596 (program): a(n) = 38*n^2  1.
 A158597 (program): a(n) = 400*n^2  20.
 A158598 (program): a(n) = 40*n^2  1.
 A158601 (program): a(n) = 400*n^2 + 20.
 A158602 (program): a(n) = 40*n^2 + 1.
 A158603 (program): a(n) = 441*n^2 + 21.
 A158604 (program): a(n) = 42*n^2 + 1.
 A158607 (program): Period 5: repeat 9,11,13,5,7.
 A158611 (program): 0, 1 and the primes.
 A158614 (program): Numbers n such that 30*n + 11 is prime.
 A158621 (program): Partial products of A001093.
 A158622 (program): Numerator of the reduced fraction A158620(n)/A158621(n).
 A158623 (program): Denominator of the reduced fraction A158620(n)/A158621(n).
 A158626 (program): a(n) = 42*n^2  1.
 A158627 (program): a(n) = 484*n^222.
 A158628 (program): a(n) = 44*n^2  1.
 A158629 (program): a(n) = 484*n^2 + 22.
 A158630 (program): a(n) = 44*n^2+1.
 A158631 (program): a(n) = 529*n^2 + 23.
 A158632 (program): a(n) = 46*n^2 + 1.
 A158633 (program): a(n) = 529*n^2  23.
 A158634 (program): a(n) = 46*n^2  1.
 A158636 (program): a(n) = 576*n^2  24.
 A158637 (program): a(n) = 576*n^2 + 24.
 A158638 (program): a(n) = 48*n^2 + 1.
 A158639 (program): a(n) = 676*n^2  26.
 A158640 (program): 52*n^2  1.
 A158643 (program): a(n) = 676*n^2 + 26.
 A158644 (program): a(n) = 52*n^2 + 1.
 A158645 (program): a(n) = 729*n^2 + 27.
 A158646 (program): a(n) = 54*n^2 + 1.
 A158648 (program): Numbers n such that 30*n + 17 is prime.
 A158655 (program): a(n) = 729*n^2  27.
 A158656 (program): a(n) = 54*n^2  1.
 A158657 (program): a(n) = 784*n^2  28.
 A158658 (program): a(n) = 56*n^2  1.
 A158659 (program): a(n) = 784*n^2 + 28.
 A158660 (program): a(n) = 56*n^2 + 1.
 A158662 (program): Sum of primes <= n if 1 is counted as a prime.
 A158665 (program): a(n) = 841*n^2 + 29.
 A158666 (program): a(n) = 58*n^2 + 1.
 A158667 (program): 841*n^2  29.
 A158668 (program): a(n) = 58*n^2  1.
 A158669 (program): a(n) = 900*n^2  30.
 A158670 (program): a(n) = 60*n^2  1.
 A158672 (program): a(n) = 900*n^2 + 30.
 A158673 (program): a(n) = 60*n^2 + 1.
 A158674 (program): Period 18: repeat 3, 4, 0, 8, 6, 3, 3, 7, 0, 2, 6, 6, 3, 1, 0, 5, 6, 0.
 A158675 (program): a(n) = 961*n^2 + 31.
 A158676 (program): a(n) = 62*n^2 + 1.
 A158677 (program): Period 6: repeat [3, 4, 0, 5, 6, 3].
 A158679 (program): a(n) = 961*n^2  31.
 A158680 (program): a(n) = 62*n^2  1.
 A158683 (program): 1024*n^2  32.
 A158684 (program): a(n) = 64*n^2  1.
 A158685 (program): 32(32n^2+1).
 A158686 (program): 64n^2 + 1.
 A158688 (program): a(n) = 1089*n^2 + 33.
 A158689 (program): a(n) = 66*n^2 + 1.
 A158692 (program): a(n) = 1089*n^2  33.
 A158693 (program): a(n) = 66*n^2  1.
 A158699 (program): Start with 0; then add one to each single digit.
 A158704 (program): Nonnegative integers with an even number of even powers of 2 in their base2 representation.
 A158705 (program): Nonnegative integers with an odd number of even powers of 2 in their base2 representation.
 A158729 (program): a(n) = 1156*n^2  34.
 A158730 (program): a(n) = 68*n^2  1.
 A158731 (program): a(n) = 1156*n^2 + 34.
 A158732 (program): a(n) = 68*n^2 + 1.
 A158733 (program): a(n) = 1225*n^2 + 35.
 A158734 (program): a(n) = 70*n^2 + 1.
 A158735 (program): a(n) = 1225*n^2  35.
 A158736 (program): a(n) = 70*n^2  1.
 A158737 (program): a(n) = 1296*n^2  36.
 A158738 (program): a(n) = 72*n^2  1.
 A158739 (program): 1296*n^2 + 36.
 A158740 (program): a(n) = 72*n^2 + 1.
 A158741 (program): a(n) = 1369*n^2 + 37.
 A158742 (program): a(n) = 74*n^2 + 1.
 A158743 (program): a(n) = 1369*n^2  37.
 A158744 (program): a(n) = 74*n^2  1.
 A158746 (program): Numbers n such that 30*n + 13 is prime.
 A158749 (program): a(n) = n * 9^n.
 A158753 (program): Lucas even count down recursion:e(n,k)=(e(n  1, k)*e(n, k  1) + 1)/e(n  1, k  1)
 A158764 (program): 38(38n^21).
 A158765 (program): a(n) = 76*n^2  1.
 A158766 (program): a(n) = 1444*n^2 + 38.
 A158767 (program): a(n) = 76*n^2 + 1.
 A158768 (program): a(n) = 1521*n^2 + 39.
 A158769 (program): a(n) = 78*n^2 + 1.
 A158770 (program): a(n) = 1521*n^2  39.
 A158771 (program): a(n) = 78*n^2  1.
 A158772 (program): a(n) = A138635(n+18)A138635(n).
 A158773 (program): a(n) = 1600*n^2  40.
 A158774 (program): a(n) = 80*n^2  1.
 A158775 (program): a(n) = 1600*n^2 + 40.
 A158776 (program): a(n) = 80*n^2 + 1.
 A158780 (program): a(2n) = A131577(n). a(2n+1) = A011782(n).
 A158791 (program): Numbers n such that 30*n + 23 is prime.
 A158799 (program): a(0)=1, a(1)=2, a(n)=3 for n>=2.
 A158803 (program): Numbers k such that k^2 == 2 (mod 41).
 A158806 (program): Numbers n such that 30*n + 19 is prime.
 A158821 (program): Triangle read by rows: row n (n>=0) ends with 1, and for n>=1 begins with n; other entries are zero.
 A158842 (program): 1 + n(n+1)(n1)/2.
 A158850 (program): Numbers n such that 30*n + 29 is prime.
 A158859 (program): a(n) is formed by 2n+1 concatenations of the digit 2r+1 where n=r (mod 5).
 A158869 (program): Number of ways of filling a 2 X 3 X 2n hole with 1 X 2 X 2 bricks.
 A158874 (program): a(n) = (n + 4)(n + 3)(n + 2)(n + 1)n / 5 = 24*A000389(n+4).
 A158879 (program): a(n) = 4^n + n.
 A158887 (program): a(n) = (n+1)^n * n! * binomial(n1 + 1/(n+1), n).
 A158894 (program): Sawtooth pattern of one, then two, then three, then four etc. consecutive odd numbers, starting each time at 3.
 A158901 (program): A051731 * (1, 1, 2, 3, 4, 5,….)
 A158907 (program): Row sums of triangle A158906.
 A158919 (program): Beatty sequence for the tribonacci constant tau (A058265): a(n) = floor(n*tau).
 A158920 (program): Binomial transform of A008805 (triangular numbers with repeats).
 A158943 (program): INVERT transform of A027656: (1, 0, 2, 0, 3, 0, 4, 0, 5, …).
 A158944 (program): Triangle by columns: the natural numbers interleaved with zeros in every column: (1, 0, 2, 0, 3, 0, 4, …)
 A158948 (program): Triangle read by rows, left border = natural numbers repeated (1, 1, 2, 2, 3, 3,…); all other columns = (1, 0, 1, 0, 1, 0,…).
 A158953 (program): Trajectory of 12 under repeated application of the map n –> A102370(n) .
 A159007 (program): Numbers k such that k == 32 or 41 (mod 73).
 A159008 (program): Positive numbers k such that k^2 == 2 (mod 89).
 A159018 (program): a(0)=5; a(n) = a(n1) + floor(sqrt(a(n1))), n > 0.
 A159026 (program): a(0)=89; a(n) = a(n1) + floor(sqrt(a(n1))), n > 0.
 A159035 (program): a(0)=1=a(1), a(2)=2, a(3)=5; thereafter a(n+3)=4a(n+2)4a(n+1)+2*a(n) for n>=1.
 A159038 (program): a(n) = 8 * n!.
 A159058 (program): A102370(n) modulo 8 .
 A159075 (program): a(1) = 1, otherwise a(n) = 0.
 A159077 (program): a(n) = A008475(n) + 1.
 A159081 (program): Let d be the largest element of A008578 which divides n, then a(n) is the position of d in A008578.
 A159083 (program): Products of 7 consecutive integers.
 A159200 (program): Decimal expansion of Sum_ k >= 1 (1/(10^(4k + 2)  1))  (1/(10^(2k + 1)  1)), negated.
 A159217 (program): 1/8 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 17
 A159219 (program): Number of n X n arrays of squares of integers with every 2X2 subblock summing to 18
 A159221 (program): 1/2 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 20
 A159222 (program): 1/4 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 21
 A159230 (program): 1/8 the number of n X n arrays of squares of integers with every 2X2 subblock summing to 31
 A159254 (program): Numbers n with property that n^2 ends with 49.
 A159277 (program): Ways to write the identity as a product of n 3cycles in symmetric group S_4.
 A159289 (program): a(n+1) = 5a(n)  2a(n1).
 A159290 (program): A generalized Jacobsthal sequence.
 A159325 (program): Median number of comparisons used by insertion sort on n (distinct) elements.
 A159328 (program): Transform of 1 by the T_ 1,1 transformation (see link)
 A159333 (program): Roman factorial of n.
 A159347 (program): Transform of the finite sequence (1, 0, 1) by the T_ 0,0 transformation.
 A159355 (program): Number of n X n arrays of squares of integers summing to 4.
 A159461 (program): Numbers of previous and following composites of nth prime.
 A159465 (program): Sums of odd numbers, omitting squares.
 A159469 (program): Maximum remainder when (k + 1)^n + (k  1)^n is divided by k^2 for variable n and k > 2.
 A159475 (program): a(1) = 1; for n >= 1, a(n) is the smallest number m > n such that gcd(n,m) > 1.
 A159477 (program): a(n) = smallest prime >= n, if 1 is counted as a prime.
 A159481 (program): Number of evil numbers <= n, see A001969.
 A159551 (program): a(n) = 101*n + 10.
 A159582 (program): Expansion of (1+6x+x^22x^3)/((x^2+2x1)(x^22*x1)), bisection is NSW numbers.
 A159612 (program): INVERT transform of (1, 3, 1, 3, 1,…).
 A159615 (program): The slowest increasing sequence beginning with a(1)=2 such that a(n) and n are both odious or both not odious.
 A159619 (program): Slowest increasing sequence beginning with 4 such that n and a(n) are either both evil or both odious.
 A159624 (program): a(n)=A159619(2n)A159615(2n)
 A159664 (program): The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11n(j)+1=a(j)a(j) and 13n(j)+1=b(j)b(j); with positive integer numbers.
 A159665 (program): The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11n(j)+1=a(j)a(j) and 13n(j)+1=b(j)b(j); with positive integer numbers.
 A159668 (program): Expansion of (1  x)/(1  28*x + x^2).
 A159674 (program): Expansion of (1  x)/(1  32*x + x^2).
 A159679 (program): a(n) are solutions of the 2 equations: 7a(n)+1 = c(n)^2 and 9a(n)+1 = b(n)^2.
 A159680 (program): The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 9n(j)+1=a(j)a(j) and 11n(j)+1=b(j)b(j) with positive integer numbers.
 A159681 (program): The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 5n(j)+1=a(j)a(j) and 7n(j)+1=b(j)b(j) with positive integer numbers.
 A159683 (program): The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 3n(j)+1=a(j)a(j) and 5n(j)+1=b(j)b(j) with positive integer numbers.
 A159684 (program): Sturmian word: limit S(infinity) where S(0) = 0, S(1) = 0,1 and for n>=1, S(n+1) = S(n)S(n)S(n1).
 A159693 (program): Partial sums of A000463.
 A159694 (program): a(0)=6, a(n) = 2*a(n1) + 2^(n1) for n > 0.
 A159695 (program): a(0)=7, a(n) = 2*a(n1) + 2^(n1) for n > 0.
 A159696 (program): a(0)=8, a(n) = 2*a(n1) + 2^(n1) for n > 0.
 A159697 (program): a(0)=9, a(n) = 2*a(n1) + 2^(n1) for n > 0.
 A159699 (program): Replace 2^k in binary expansion of n with A045623(k+1).
 A159715 (program): Number of permutations of 2 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159721 (program): Number of permutations of 3 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159727 (program): Number of permutations of 4 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159733 (program): Number of permutations of 5 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159736 (program): Number of permutations of 6 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159738 (program): Number of permutations of 7 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159739 (program): Number of permutations of 8 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159740 (program): Number of permutations of 9 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.
 A159741 (program): a(n) = 8*(2^n  1).
 A159742 (program): If an array is made of columns of nacci sequences (Fibonacci, tribonacci, etc.), all starting with 1,1,2,…, the NWtoSE diagonals can be extended by computation. This sequence is diagonal 6. See A159741 for details.
 A159754 (program): Numbers n with property that n^2 ends with 81.
 A159797 (program): Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n1.
 A159833 (program): a(n) = n^2*(n^2 + 15)/4.
 A159852 (program): n^2 mod 60.
 A159912 (program): Partial sums of A159913(k) = 2^bitcount(2k+1)1 = A038573(2k+1), bitcount=A000120.
 A159913 (program): a(n) = 2^(A000120(n)+1)1, where A000120(n) = number of nonzero bits in n.
 A159914 (program): Half the number of (n3)element subsets of 1,…,n whose elements sum up to an odd value.
 A159915 (program): a(n) = floor((n+1)/4)*floor(n/2).
 A159917 (program): Fixed point of the morphism 0 > 01, 1 > 2, 2 > 01, starting from a(0) = 0.
 A159918 (program): Number of ones in binary representation of n^2.
 A159920 (program): Sums of the antidiagonals of Sundaram’s sieve (A159919).
 A159928 (program): a(n) is the sum of the terms of row n of triangle A159927.
 A159938 (program): The number of homogeneous trisubstituted linear alkanes.
 A159940 (program): The number of trisubstitution products with composition C_n H_(2n1) X_2 Y.
 A159941 (program): Number of trisubstituted linear alkanes of composition C_n H_(2n1) XYZ.
 A159955 (program): Period 9: repeat [0, 1, 2, 1, 2, 0, 2, 0, 1].
 A159956 (program): Period 16 : 0,1,2,3,1,2,3,0,2,3,0,1,3,0,1,2 .
 A159957 (program): Period 25 : 0,1,2,3,4,1,2,3,4,0,2,3,4,0,1,3,4,0,1,2,4,0,1,2,3 .
 A159964 (program): a(n) = 2^n*(1n).
 A159966 (program): Lodumo_4 of A102370 (sloping binary numbers).
 A159981 (program): Catalan numbers read modulo 4.
 A159984 (program): Catalan numbers read modulo 5 .
 A159986 (program): Catalan numbers read modulo 7.
 A159987 (program): Catalan numbers read modulo 8.
 A159988 (program): Catalan numbers read modulo 11 .
 A159989 (program): Catalan numbers read modulo 12.
 A159991 (program): Powers of 60.
 A160017 (program): Lodumo_2 of ThueMorse sequence A010060.
 A160050 (program): Numerator of the Harary number for the star graph s_n.
 A160093 (program): Number of digits in n, excluding any trailing zeros.
 A160094 (program): 1 + the number of trailing zeros in n (A122840).
 A160128 (program): a(n) = number of grid points that are covered after (2^n)th stage of A139250.
 A160138 (program): a(n) = number of solutions to the system: x + y + z + w = n, 2x  y + z + 2w = 5 with nonnegative x, y, z, w.
 A160154 (program): 10^n9n for n>=1
 A160156 (program): Partial sums of A007583.
 A160174 (program): a(n) = (2n  1)(24n^2  42n + 19).
 A160180 (program): Largest proper divisor of the nth composite number.
 A160186 (program): Lodumo_5 of Lucas numbers.
 A160217 (program): Minimal increasing sequence with a(1)=3 and the property that a(n) and n are both in or both not in A003159.
 A160242 (program): Triangle A(n,m) read by rows: a quarter of the Fourier coefficient [cos(mt)] of the shifted Boubaker polynomial B_n(2cos t)2cos(nt).
 A160250 (program): a(n) = 64n^3  168n^2 + 148*n  43.
 A160272 (program): Angle between the two hands of a 12 hour analog clock n*12 minutes after noon/midnight, measured in units of minutes.
 A160278 (program): Angle in degrees between the two hands of a 12hour analog clock at 12*n minutes after noon/midnight.
 A160372 (program): The 4tuple (2, ((2n+1)^21)/2, (2n+3)^21)/2, a(n) , where a(n)=4(3+20n+42n^2+32n^3+8n^4), has Diophantus’ property that the product of any two distinct terms plus one is a square.
 A160378 (program): a(n) = n^3  n*(n+1)/2.
 A160380 (program): a(0) = 0; for n >= 1, a(n) = number of 0’s in base4 representation of n.
 A160381 (program): Number of 1’s in base4 representation of n.
 A160382 (program): Number of 2’s in base4 representation of n.
 A160383 (program): Number of 3’s in base4 representation of n.
 A160384 (program): Number of nonzero digits in the base3 representation of n.
 A160385 (program): Number of nonzero digits in base4 representation of n.
 A160388 (program): Decimal expansion of (e + 1)/3.
 A160390 (program): Decimal expansion of sqrt(3)  1.
 A160410 (program): Number of “ON” cells at nth stage in simple 2dimensional cellular automaton (see Comments for precise definition).
 A160412 (program): Number of “ON” cells at nth stage in simple 2dimensional cellular automaton (see Comments for precise definition).
 A160413 (program): a(n) = A160411(n+1)/4.
 A160428 (program): Number of ON cells at nth stage of threedimensional version of the cellular automaton A160410, using cubes.
 A160429 (program): First differences of A160428.
 A160451 (program): (4/3)u(u^3+6*u^2+8u3) where u=Floor[ 3n+5)/2].
 A160457 (program): a(n) = n^2  2*n + 2.
 A160467 (program): a(n) = 1 if n is odd; otherwise, a(n) = 2^(k1) where 2^k is the largest power of 2 that divides n.
 A160511 (program): Number of weighings needed to find lighter coins among n coins.
 A160517 (program): A walk of 10divisible “less regular” figurate cuboctahedra, from sequence A160249.
 A160529 (program): a(1) = 1; for n>1, a(n) = a(n1) + d1 + d2 where d1 = 4 if n is even. d1 = 1 if n is odd, d2 = 15 if n mod 4 = 0, d2 = 0 if n mod 4 != 0.
 A160536 (program): a(n) = Fibonacci(n) + n^2.
 A160538 (program): a(n) = 4*(n^4n^3).
 A160542 (program): Not divisible by 11
 A160543 (program): Not divisible by 17
 A160544 (program): Not divisible by 19.
 A160545 (program): Numbers coprime to 21.
 A160547 (program): Not divisible by 31.
 A160551 (program): Number of (unordered) ways of making change for n dollars using coins of denominations 1, 5, 10, and 25.
 A160588 (program): Interleaving of A053645 and A000027.
 A160590 (program): Nexttoleast significant digit of 2^n.
 A160595 (program): Numerator of resilience R(n) = phi(n)/(n1), with a(1) = 1 by convention.
 A160596 (program): Denominator of resilience R(n) = phi(n)/(n1).
 A160637 (program): Hankel transform of A114464(n+1).
 A160638 (program): Bitreversed 8bit binary numbers.
 A160651 (program): a(n) is the number of triangular nonnegative integers that are each equal to n(n+1)/2  m(m+1)/2, for some m’s where 0 <= m <= n.
 A160656 (program): The odd prime numbers together with 0: p  (1)^p  1 where p = nth prime.
 A160664 (program): a(n) = a(n1) + A000203(n), a(0)=1.
 A160674 (program): A bisection of A063522.
 A160675 (program): Duplication root: the maximal number of distinct squarefree words that a word of length n can be reduced to by iterated application of stringrewriting rules uu>u.
 A160682 (program): The list of the A values in the common solutions to 13k+1 = A^2 and 17k+1 = B^2.
 A160695 (program): Integers m such that 3m+1 and 7m+1 are both perfect squares.
 A160696 (program): Largest k such that k^2 divides prime(n)+1.
 A160699 (program): A bisection of A063522.
 A160706 (program): Hankel transform of A052702(n+1).
 A160713 (program): 3 times numbers of Gould’s sequence: a(n) = A001316(n)*3.
 A160720 (program): Number of “ON” cells at nth stage in 2dimensional cellular automaton (see Comments for precise definition).
 A160721 (program): First differences of A160720.
 A160722 (program): Number of “ON” cells at nth stage in a certain 2dimensional cellular automaton based on Sierpinski triangles (see Comments for precise definition).
 A160723 (program): First differences of A160722.
 A160742 (program): a(n) = A151566(n)*2.
 A160744 (program): a(n) = A151566(n)*3.
 A160745 (program): First differences of A160744.
 A160746 (program): a(n) = A151566(n)*4.
 A160747 (program): Expansion of (1+10x+20x^2+10*x^3+x^4)/(1x)^5.
 A160749 (program): a(n) = (11n^2 + 19n + 10)/2.
 A160755 (program): Number of correct digits of the MRB constant derived from the sequence of partial sums up to m=10^n terms as defined by S[n]= Sum[(1)^k*(k^(1/k)1), k,m ].
 A160765 (program): Expansion of (1+13x+32x^2+13*x^3+x^4)/(1x)^5.
 A160767 (program): Expansion of (1+12x+28x^2+12*x^3+x^4)/(1x)^5.
 A160772 (program): Number of nodes (or order) of a graph model obtained using an automata scheme on sets of order prime(n) >= 5 and in which all not halt states are linked by arcs (edges).
 A160790 (program): Vertex number of a rectangular spiral. The first differences (A160791) are the edge lengths of the spiral. The distances between two nearest edges, that are parallel to the initial edge, are the natural numbers.
 A160791 (program): First differences of A160790.
 A160799 (program): Partial sums of A160410.
 A160805 (program): a(n) = (2n^3 + 9n^2 + n + 24) / 6.
 A160807 (program): a(n) = A160799(n)/4.
 A160811 (program): Numbers not dividing 24.
 A160827 (program): a(n) = 3n^4 + 12n^3 + 30n^2 + 36n + 17.
 A160828 (program): a(n) = 4n^4 + 24n^3 + 84n^2 + 144n + 98.
 A160830 (program): Integer part of the product of two consecutive primes divided by their sum.
 A160842 (program): Number of lines through at least 2 points of a 2 X n grid of points.
 A160843 (program): Number of lines through at least 2 points of a 3 X n grid of points.
 A160869 (program): a(n) = sigma(6^(n1)).
 A160873 (program): Number of isomorphism classes of connected (D_4)fold coverings of a connected graph with circuit rank n.
 A160902 (program): Square array read by antidiagonals: a(m,n) = the smallest prime >= m*n.
 A160903 (program): Square array read by antidiagonals: a(m,n) = the largest noncomposite <= m*n.
 A160909 (program): Row sums of triangle defined in A096539.
 A160912 (program): [1, 3, 5, 7,…] convolved with [1, 4, 0, 0, 0,…]
 A160914 (program): Extended sblock elements for Janet table.
 A160924 (program): a(n)= n + reversal(n+1)
 A160925 (program): a(n)= n  reversal(n+1)
 A160926 (program): a(n)= n * reversal(n+1)
 A160927 (program): a(n) = n + reversal(n1).
 A160928 (program): a(n) = n  reversal(n1)
 A160929 (program): a(n)= n * reversal(n1)
 A160931 (program): a(n)= n + digital sum(n+1)
 A160938 (program): a(n)= n * digital sum(n+1)
 A160939 (program): a(n) = n + digital sum (n1).
 A160941 (program): a(n)= n  digital sum(n1)
 A160942 (program): a(n)= n * digital sum(n1)
 A160949 (program): a(n) = n  digital sum(n+1)
 A160958 (program): a(n) = (9^n  (7)^n)/(9  (7)).
 A160973 (program): a(n) is the number of positive integers of the form (n3k)/(2k+1), 1 <= k <= (n1)/5.
 A161003 (program): A list of the composite numbers divided by their largest prime factors.
 A161007 (program): a(n+1) = 2a(n) + 16a(n1), a(0)=0, a(1)=1.
 A161116 (program): a(n) is the number of nontrivial positive divisors of 2n+3.
 A161120 (program): Number of cycles with entries of opposite parities in all fixedpointfree involutions of 1,2,…,2n .
 A161122 (program): Number of cycles with entries of the same parity in all fixedpointfree involutions of 1,2,…,2n .
 A161124 (program): Number of inversions in all fixedpointfree involutions of 1,2,…,2n .
 A161168 (program): a(n) = 2^n + 4^n.
 A161175 (program): Triangle read by rows, modified ThueMorse sequence (A010060 with offset 1): change 0 to 2, else 1.
 A161176 (program): 4n^210n+107.
 A161188 (program): Let S = A089237\ 0 = union of primes and nonzero squares; sequence gives indices of primes.
 A161199 (program): Numerators in expansion of (1x)^(5/2).
 A161205 (program): Triangle read by rows in which row n lists 2n1 followed by 2n numbers 2n.
 A161321 (program): Decimal expansion of (sqrt(35)5)/10.
 A161339 (program): Partial sums of A161205.
 A161342 (program): Number of “ON” cubic cells at nth stage in simple 3dimensional cellular automaton: a(n) = A160428(n)/8.
 A161343 (program): a(n) = 7^A000120(n).
 A161344 (program): Numbers k with A033676(k)=2, where A033676 is the largest divisor <= sqrt(k).
 A161345 (program): Numbers k whose largest divisor <= sqrt(k) is 3.
 A161346 (program): a(n) = A161345(n)/3.
 A161365 (program): a(n) = 3/2 + 5n  5(1)^n/2.
 A161370 (program): a(n) = 2*A010844(n) + 1.
 A161382 (program): (0,1)sequence where nth run has length n^2.
 A161385 (program): (1,2)sequence where nth run has length n^2.
 A161411 (program): First differences of A160410.
 A161416 (program): Partial sums of A056737.
 A161418 (program): Number of triangles in the Ytoothpick structure after n rounds.
 A161422 (program): a(n) = A161418(n)/6.
 A161424 (program): Numbers k whose largest divisor <= sqrt(k) equals 4.
 A161425 (program): a(n) = A161424(n)/2.
 A161428 (program): a(n) = A161424(n)/4.
 A161435 (program): Number of reduced words of length n in the Weyl group A_3 (or D_3).
 A161462 (program): Final digit of the sum of all the integers from n to 2*n1.
 A161474 (program): Triple factorials n!!!: a(n) = n*a(n3).
 A161511 (program): Number of 1…0 pairs in the binary representation of 2n.
 A161517 (program): Sum of remainders of c mod k where k = 1, 2, 3, …, c and c is the nth composite number.
 A161522 (program): prime(n)*( prime(n)n ).
 A161528 (program): Expansion of the qseries Sum_ n >= 0 (1)^nq^(n(n+1)/2)(1q)(1q^2)…(1q^n)/((1q^(n+1))(1q^(n+2))…(1q^(2n+1))).
 A161532 (program): a(n) = 2n^2 + 8n + 1.
 A161537 (program): a(n) = nth composite + n.
 A161549 (program): a(n) = 2n^2 + 14n + 1.
 A161550 (program): Largest prime <= n^2+n.
 A161560 (program): a(n) = floor(A000069(n)/21/2).
 A161569 (program): Sum of first n nonprimes minus their indices.
 A161582 (program): The list of the k values in the common solutions to the 2 equations 5k+1=A^2, 9k+1=B^2.
 A161583 (program): The list of the k values in the common solutions to the 2 equations 15k+1=A^2, 19k+1=B^2.
 A161584 (program): The list of the k values in the common solutions to the 2 equations 13k+1=A^2, 17k+1=B^2.
 A161585 (program): The list of the k values in the common solutions to the 2 equations 7k+1=A^2, 11k+1=B^2.
 A161587 (program): a(n) = 13n^2 + 10n + 1.
 A161588 (program): The list of the k values in the common solutions to the 2 equations 11k+1=A^2, 15k+1=B^2.
 A161595 (program): The list of the A values in the common solutions to the 2 equations 15k+1=A^2, 19k+1=B^2.
 A161617 (program): 8n^2+20n+1.
 A161625 (program): Sum of all numbers from 1 up to the final digit of prime(n).
 A161654 (program): a(n) = the largest multiple of the number of divisors of n that is <= n.
 A161655 (program): a(n) = the smallest multiple of the number of divisors of n that is >= n.
 A161664 (program): Sum_ i=1..n id(i), where d(n) is the number of divisors of n (A000005).
 A161680 (program): a(n) = binomial(n,2): number of size2 subsets of 0,1,…,n that contain no consecutive integers.
 A161696 (program): Number of reduced words of length n in the Weyl group B_3.
 A161701 (program): a(n) = (n^5  5n^4 + 5n^3 + 5n^2 + 114n + 120)/120.
 A161702 (program): a(n) = (n^3 + 9n^2  5n + 3)/3.
 A161703 (program): a(n) = (4n^3  12n^2 + 14*n + 3)/3.
 A161705 (program): a(n) = 18*n + 1.
 A161707 (program): a(n) = (4n^3  9n^2 + 11*n + 3)/3.
 A161708 (program): a(n) = n^3 + 7n^2  5n + 1.
 A161709 (program): a(n) = 22*n + 1.
 A161712 (program): a(n) = (4n^3  6n^2 + 8*n + 3)/3.
 A161714 (program): a(n) = 28*n + 1.
 A161718 (program): Expansion of (1+3*x^2)/(1+x)^2.
 A161720 (program): a(n) = (prime(n)  7)/2.
 A161726 (program): a(n) = n^2  917*n + 9479.
 A161731 (program): Expansion of (13x)/(18x+14*x^2).
 A161737 (program): Numerators of the column sums of the BG2 matrix.
 A161738 (program): Sequence related to the column sums of the BG2 matrix
 A161744 (program): The subfactorial with index prime(n).
 A161745 (program): The subfactorial with index Fibonacci(n).
 A161753 (program): Squares of nonprime numbers A141468.
 A161758 (program): a(n)=np+1 where p is the maximal prime less than n2.
 A161764 (program): a(n) is the largest multiple of the number of 1’s in the binary representation of n that is <= n.
 A161770 (program): n 1’s followed by three 0’s.
 A161777 (program): nth nonprime*(nth nonprime1)/2
 A161816 (program): Denominator of fraction in Redheffer type matrix.
 A161823 (program): Among any n lines on the plane, there exists a pair at an angle not more than a(n)degrees.
 A161827 (program): Complement of A006446.
 A161828 (program): Number of rhombuses in the Ytoothpick structure of A160120 after n rounds.
 A161834 (program): a(n) = A161828(n)/3.
 A161836 (program): Number of concaveconvex hexagons in the Ytoothpick structure of A160120 after n rounds.
 A161838 (program): a(n) = A161836(n)/3.
 A161840 (program): Number of noncentral divisors of n.
 A161841 (program): Number of factors, with repetition, in all distinct pairs (a <= b) such that a*b = n.
 A161842 (program): Partial sums of A161841.
 A161847 (program): Denominator of the ratio (prime((n+1)^2)  prime(n^2))/prime(n).
 A161886 (program): Number of nonzero elements in the n X n Redheffer matrix.
 A161912 (program): a(n) = A040976(n+1)  A006218(n).
 A161916 (program): The smallest k such that A010060(n+k)=A010060(n).
 A161920 (program): a(n) = A161511(A004760(n)).
 A161935 (program): 28gonal numbers: a(n) = n(13n  12).
 A161938 (program): a(n) = ((3+sqrt(2))(2+sqrt(2))^n + (3sqrt(2))(2sqrt(2))^n)/2.
 A161939 (program): a(n) = ((3+sqrt(2))(4+sqrt(2))^n + (3sqrt(2))(4sqrt(2))^n)/2.
 A161941 (program): a(n) = ((4+sqrt(2))(2+sqrt(2))^n + (4sqrt(2))(2sqrt(2))^n)/4.
 A161942 (program): Odd part of sum of divisors of n.
 A161944 (program): a(n) = ((4+sqrt(2))(3+sqrt(2))^n + (4sqrt(2))(3sqrt(2))^n)/4.
 A161983 (program): Irregular triangle read by rows: the group of 2n + 1 integers starting at A014105(n).
 A162024 (program): Number of n X n binary arrays with rows and columns, considered as binary numbers, in nondecreasing order, and all but the outermost row or column zero.
 A162147 (program): a(n) = n(n+1)(5*n + 4)/6.
 A162148 (program): a(n) = n(n+1)(5*n+7)/6.
 A162154 (program): Oddindexed terms are the number of consecutive prime numbers until a composite, evenindexed terms are the number of consecutive composite numbers until a prime.
 A162177 (program): a(n) is the number of composite numbers that are smaller than A008578(n).
 A162194 (program): Sum of divisors of nonprime number A018252(n).
 A162213 (program): a(n) = the smallest positive multiple of n with exactly n digits when written in binary.
 A162214 (program): a(n) = the largest positive multiple of n with exactly n digits when written in binary.
 A162254 (program): a(n) = (2n^3 + 5n^2 + n)/2.
 A162255 (program): a(n) = 2*a(n2) for n > 2; a(1) = 3, a(2) = 2.
 A162256 (program): a(n) = (2n^3 + 5n^2  3*n)/2.
 A162257 (program): a(n) = (2n^3 + 5n^2  11*n)/2.
 A162258 (program): a(n) = (2n^3 + 5n^2  9*n)/2.
 A162259 (program): a(n) = (2n^3 + 5n^2  17*n)/2.
 A162260 (program): a(n) = (n^3 + 4*n^2  n)/2.
 A162261 (program): a(n) = (2n^3 + 5n^2  7*n)/2.
 A162262 (program): a(n) = (2n^3 + 5n^2  13*n)/2.
 A162263 (program): a(n) = (2n^3 + 5n^2 + 11*n)/2.
 A162264 (program): a(n) = (2n^3 + 5n^2 + 7*n)/2.
 A162265 (program): a(n) = (2n^3 + 5n^2  5*n)/2.
 A162266 (program): a(n) = (2n^3 + 5n^2 + 21*n)/2.
 A162267 (program): a(n) = (2n^3 + 5n^2 + 5*n)/2.
 A162268 (program): a(n) = ((5+sqrt(2))(1+sqrt(2))^n + (5sqrt(2))(1sqrt(2))^n)/2.
 A162269 (program): a(n) = ((5+sqrt(2))(2+sqrt(2))^n + (5sqrt(2))(2sqrt(2))^n)/2.
 A162270 (program): a(n) = ((5+sqrt(2))(3+sqrt(2))^n + (5sqrt(2))(3sqrt(2))^n)/2.
 A162273 (program): a(n) = ((2+sqrt(3))(3+sqrt(3))^n + (2sqrt(3))(3sqrt(3))^n)/2.
 A162285 (program): Periodic length 8 sequence [1, 1, 1, 1, 1, 1, 1, 1, …].
 A162289 (program): a(n) = 1 if n is relatively prime to 30 else 0.
 A162316 (program): a(n) = 5n^2 + 20n + 1.
 A162330 (program): Blocks of 4 numbers of the form 2k, 2k1, 2k, 2k+1, k=1,2,3,4,…
 A162345 (program): Length of nth edge in the graph of the zigzag function for prime numbers.
 A162349 (program): First differences of A160412.
 A162356 (program): a(n) = 8a(n1)14a(n2) for n>1; a(0) = 2; a(1) = 9.
 A162395 (program): a(n) = (1)^n * n^2.
 A162396 (program): a(n) = 2*a(n2) for n > 2; a(1) = 5, a(2) = 2.
 A162397 (program): a(n) = n * Kronecker(3, n).
 A162436 (program): a(n) = 3*a(n2) for n > 2; a(1) = 1, a(2) = 3.
 A162439 (program): Write down the binary representation of n. Partition the string which is this binary representation by placing a ‘+’ just left of every 1. Add the resulting base 2 numbers. a(n) = decimal equivalent of this sum.
 A162462 (program): Sum of all numbers from n to sigma(n).
 A162466 (program): a(n) = 12*a(n2) for n > 2; a(1) = 1, a(2) = 8.
 A162483 (program): a(n) is the number of perfect matchings of an edgelabeled 2 X (2n+1) Mobius grid graph.
 A162484 (program): a(1) = 2, a(2) = 8; a(n) = 2 a(n  1) + a(n  2)  4*(n mod 2).
 A162485 (program): a(1) = 4, a(2) = 6; a(n) = 2 a(n  1) + a(n  2)  4 Mod[n  1, 2]
 A162495 (program): Number of reduced words of length n in the icosahedral reflection group [3,5] of order 120.
 A162510 (program): Dirichlet inverse of A076479.
 A162511 (program): Multiplicative function with a(p^e)=(1)^(e1)
 A162526 (program): Numbers k whose largest divisor <= sqrt(k) equals 6.
 A162540 (program): a(n) = (2n+1)(2n+3)(2*n+5)/3.
 A162550 (program): 2n repeated C_n times, where C_n = A000108(n) is a Catalan number.
 A162551 (program): a(n) = 2 * C(2*n,n1).
 A162559 (program): a(n) = ((4+sqrt(3))(1+sqrt(3))^n + (4sqrt(3))(1sqrt(3))^n)/2.
 A162560 (program): a(n) = (4+sqrt(3))(3+sqrt(3))^n + (4sqrt(3))(3sqrt(3))^n.
 A162562 (program): a(n) = ((5+sqrt(3))(1+sqrt(3))^n + (5sqrt(3))(1sqrt(3))^n)/2.
 A162563 (program): a(n) = ((5+sqrt(3))(2+sqrt(3))^n + (5sqrt(3))(2sqrt(3))^n)/2.
 A162607 (program): a(n) = n(n^2  4n + 5)/2.
 A162609 (program): Triangle read by rows in which row n lists n terms, starting with 1, with gaps = n2 between successive terms.
 A162610 (program): Triangle read by rows in which row n lists n terms, starting with 2n1, with gaps = n1 between successive terms.
 A162626 (program): If 0 <= n <= 3 then a(n) = n(n+1)(n+2)/3, if n >= 4 then a(n) = n(n^2+5)/3.
 A162630 (program): Triangle read by rows in which row n lists the number of states of the subshells of the nth shell of the nuclear shell model ordered by energy level in increasing order.
 A162642 (program): Number of odd exponents in the canonical prime factorization of n.
 A162668 (program): a(n) = n(n+1)(n+2)*(n+3)/3.
 A162669 (program): a(n) = n(n+1)(n+2)(n+3)(n+4)*(n+5)/5.
 A162673 (program): Number of different fixed (possibly) disconnected trominoes bounded (not necessarily tightly) by an n*n square
 A162698 (program): Numbers n such that the incidence matrix of the grid n X n has 1 as eigenvalue.
 A162699 (program): Odd numbers not divisible by 7.
 A162725 (program): a(n) = 8a(n1)  19a(n2) + 12*a(n3) (n >= 3) with a(0) = a(1) = 1, a(2) = 2.
 A162729 (program): a(n) = 5^n*(5^n1)/2.
 A162735 (program): An alternating sum of all numbers from prime(n) to prime(n+1).
 A162740 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.
 A162751 (program): Write down in binary the nth positive (odd) integer that is a palindrome in base 2. Take only the leftmost half of the digits (including the middle digit if there are an odd number of digits). a(n) is the decimal equivalent of the result.
 A162761 (program): Minimal total number of floors an elevator must move to transport n people initially waiting at floors i = 1, …, n to their destination floors ni+1 (= n, …, 1), when the elevator can hold at most one person at a time and starts at floor 1, and no passenger may get off the elevator before reaching his/her destination.
 A162762 (program): Minimal number of floors an elevator must move to transport n passengers initially waiting at floors i = 1, …, n to their destinations, floor n+1i (= n, …, 1), if the elevator can transport at most C = 2 persons at a time and starts at floor 1, and no one may get off the elevator before reaching their destination.
 A162766 (program): a(n) = 3*a(n2) for n > 2; a(1) = 4, a(2) = 3.
 A162769 (program): a(n) = ((1+sqrt(5))(4+sqrt(5))^n + (1sqrt(5))(4sqrt(5))^n)/2.
 A162770 (program): a(n) = ((2+sqrt(5))(1+sqrt(5))^n + (2sqrt(5))(1sqrt(5))^n)/2.
 A162771 (program): a(n) = ((2+sqrt(5))(3+sqrt(5))^n + (2sqrt(5))(3sqrt(5))^n)/2.
 A162773 (program): a(n) = ((2+sqrt(5))(5+sqrt(5))^n + (2sqrt(5))(5sqrt(5))^n)/2.
 A162775 (program): a(n) = A141042(n+1)/2.
 A162776 (program): a(n) = A161828(n)*2/3.
 A162784 (program): a(n) = (A048883(n)+1)/2.
 A162786 (program): a(n) = A162526(n)/6.
 A162800 (program): a(n) = nth grid point that is covered by the zigzag function for prime numbers such that the grid point is a vertex in the graph of the function.
 A162801 (program): Bisection of A162800.
 A162802 (program): Bisection of A162800.
 A162813 (program): a(n) = 3*a(n2) for n > 2; a(1) = 5, a(2) = 3.
 A162814 (program): a(n) = 6a(n1)6a(n2) for n > 1; a(0) = 5, a(1) = 18.
 A162845 (program): Sum of digits of binomial(3n,n).
 A162852 (program): a(n) = 3*a(n2) for n > 2; a(1) = 3, a(2) = 1.
 A162897 (program): a(1)=a(2)=2. a(n) = the smallest integer >= 2 such that a(n1)^a(n) > a(n2)^a(n1).
 A162899 (program): Partial sums of [A052938(n)^2].
 A162917 (program): Numbers n which are not in A161983.
 A162939 (program): A 1based alternate sum over the numbers from 0 to prime(n).
 A162940 (program): Binomial[n + 1, 2]*6^2 .
 A162942 (program): Binomial[n + 1, 2]*7^2 .
 A162959 (program): The pairs (x,y) such that (x^2 + y^2)/(x*y + 1) is a perfect square, i.e., 4.
 A162962 (program): a(n) = 5*a(n2) for n > 2; a(1) = 1, a(2) = 5.
 A162963 (program): a(n) = 5*a(n2) for n > 2; a(1) = 2, a(2) = 5.
 A162964 (program): a(n) = sigma(sigma(sigma(sigma(sigma(n))))).
 A162968 (program): Number of pairs of consecutive nonfixed points in all permutations of 1,2,…,n .
 A162970 (program): Number of 2cycles in all involutions of 1,2,…,n .
 A162988 (program): n appears A008578(n) times.
 A162991 (program): The first right hand column of triangle A162990
 A162993 (program): The second left hand column of triangle A162990
 A162994 (program): The third left hand column of triangle A162990
 A163057 (program): An alternating sum from the nth odd number up to the nth odd prime.
 A163062 (program): a(n) = ((3+sqrt(5))(1+sqrt(5))^n + (3sqrt(5))(1sqrt(5))^n)/2.
 A163063 (program): Lucas(3n+2) = Fibonacci(3n+1) + Fibonacci(3n+3).
 A163069 (program): a(n) = ((4+sqrt(5))(1+sqrt(5))^n + (4sqrt(5))(1sqrt(5))^n)/2.
 A163070 (program): a(n) = ((4+sqrt(5))(2+sqrt(5))^n + (4sqrt(5))(2sqrt(5))^n)/2.
 A163071 (program): a(n) = ((4+sqrt(5))(3+sqrt(5))^n + (4sqrt(5))(3sqrt(5))^n)/2.
 A163095 (program): a(n) = A000788(n)^2.
 A163102 (program): a(n) = n^2*(n+1)^2/2.
 A163105 (program): a(n) = tau(sigma(tau(n))), where tau = number of divisors of n (A000005), and sigma = sum of divisors of n (A000203).
 A163106 (program): a(n) = sigma(sigma(tau(n))), where tau = number of divisors and sigma = sum of divisors.
 A163107 (program): a(n) = tau(tau(sigma(n))), where tau = A000005, the number of divisors, and sigma = A000203, the sum of divisors of n.
 A163108 (program): a(n) = sigma(tau(sigma(n))).
 A163109 (program): a(n) = phi(tau(n)).
 A163114 (program): a(n) = 5*a(n2) for n > 2; a(1) = 3, a(2) = 5.
 A163128 (program): a(n) is the nth selfnumber minus n.
 A163139 (program): First differences of A163128.
 A163141 (program): a(n) = 5*a(n2) for n > 2; a(1) = 4, a(2) = 5.
 A163163 (program): a(n) = sigma(n) + tau(n)  n.
 A163165 (program): a(n) = 20a(n1)  96a(n2) for n > 1; a(0) = 1, a(1) = 10.
 A163169 (program): a(n) = minimal number of consecutive integers required which when summed make n.
 A163180 (program): a(n) = tau(n) + Sum_ k=1..n (n mod k).
 A163198 (program): Sum of the cubes of the first n evenindexed Fibonacci numbers.
 A163199 (program): Sum of the cubes of the first n evenindexed Fibonacci numbers, minus 1.
 A163200 (program): Sum of the cubes of the first n oddindexed Fibonacci numbers.
 A163227 (program): Fibonacciaccumulation sequence.
 A163250 (program): The number of nonisomorphic complete simple games with n voters of two different types.
 A163271 (program): Numerators of fractions in a ‘zerotransform’ approximation of sqrt(2) by means of a(n) = (a(n1) + c)/(a(n1) + 1) with c=2 and a(1)=0.
 A163274 (program): a(n) = n^4*(n+1)^2/2.
 A163275 (program): a(n) = n^5*(n+1)^2/2.
 A163276 (program): a(n) = n^6*(n+1)^2/2.
 A163277 (program): a(n) = n^7*(n+1)^2/2.
 A163279 (program): a(n) = (n^6 + 2n^5 + 2n^4 + n^3 + 2n)/2.
 A163291 (program): Number of digits of nth prime written in base 4.
 A163292 (program): a(n) = nth prime minus (number of digits of nth prime written in base 4).
 A163293 (program): a(n) = nth prime minus (number of bits in binary expansion of nth prime).
 A163296 (program): Absolute value of the Sum_ x=0..A141468(n) x*(1)^x.
 A163297 (program): a(n) = sum of divisors of n plus length of the binary expansion of n.
 A163298 (program): Sum of divisors of n minus binary order of n.
 A163299 (program): a(n) = (the number of divisors of n)^(the binary order of n).
 A163300 (program): Zero together with the even nonprimes.
 A163303 (program): a(n) = n^3 + 73*n^2 + n + 67.
 A163305 (program): Numerators of fractions in the approximation of the square root of 5 satisfying: a(n)= (a(n1)+ c)/(a(n1)+1); with c=5 and a(1)=0. Also product of the powers of two and five times the Fibonacci numbers.
 A163322 (program): The 3rd Hermite Polynomial evaluated at n: H_3(n) = 8n^3  12n.
 A163323 (program): The 4th Hermite Polynomial evaluated at n: H_4(n) = 16n^4  48n^2 + 12.
 A163348 (program): a(n) = 6a(n1)  7a(n2) for n > 1; a(0) = 1, a(1) = 7.
 A163350 (program): a(n) = 8a(n1)  14a(n2) for n > 1; a(0) = 1, a(1) = 6.
 A163366 (program): a(n) = (1)^floor((prime(n)+2)/2) mod prime(n).
 A163367 (program): a(n) = phi(tau(sigma(n))).
 A163368 (program): a(n) = phi(sigma(tau(n))).
 A163369 (program): a(n) = sigma(sigma(phi(n))).
 A163370 (program): a(n) = phi(sigma(phi(n))).
 A163371 (program): a(n) = tau(phi(sigma(n)))
 A163372 (program): a(n) = sigma(phi(sigma(n))).
 A163373 (program): a(n) = phi(phi(sigma(n))).
 A163377 (program): a(n) = tau(phi(tau(n))).
 A163378 (program): a(n) = sigma(phi(tau(n))).
 A163379 (program): a(n) = phi(phi(tau(n))).
 A163383 (program): a(n) = (n1)*2^n  1.
 A163395 (program): a(n) = (nth even nonprime)^(nth even number).
 A163400 (program): Number of bits in binary expansion of nth nonprime.
 A163403 (program): a(n) = 2*a(n2) for n > 2; a(1) = 1, a(2) = 2.
 A163417 (program): a(n) = 2^(floor((n1)/2))  n*(n1)/2.
 A163433 (program): Number of different fixed (possibly) disconnected trominoes bounded tightly by an n X n square.
 A163434 (program): Number of different fixed (possibly) disconnected tetrominoes bounded tightly by an n X n square.
 A163435 (program): Number of different fixed (possibly) disconnected pentominoes bounded tightly by an n X n square.
 A163449 (program): A007582 written in base 2.
 A163450 (program): A028403 written in base 2.
 A163455 (program): a(n) = binomial(5*n1,n).
 A163456 (program): a(n) = binomial(5*n,n)/5.
 A163464 (program): Cumulative sum of a repeated shiftandadd operation on the base7 representation of prime(n).
 A163467 (program): a(n) = floor(p/2) * floor(floor(p/2)/2) * floor(floor(floor(p/2)/2)/2) * … * 1, where p=prime(n).
 A163468 (program): Indices k such that half of the kth nonprime nonnegative integer is prime.
 A163489 (program): Indices n such that composite(n)/3 is prime.
 A163491 (program): A fractal sequence (if we delete the first occurrence of n we get the sequence itself).
 A163508 (program): The sum of the prime factors (with repetition) of the sum of 2 successive primes.
 A163520 (program): a(n) is the least integer x such that n < x and the product n*x is divisible by an integer y where n < y < x.
 A163522 (program): a(1)=2; for n>1, a(n) = sum of digits of a(n1)^2.
 A163523 (program): a(n) = tau(n) + omega(n).
 A163563 (program): n occurs 1+a(n) times starting with a(1)=1.
 A163575 (program): Remove all trailing bits equal to (n mod 2) in binary representation of n.
 A163581 (program): Number of zeros of sin(x) in integer intervals starting with (0,1).
 A163584 (program): Number of singularities of tan(x) in integer intervals starting with (0,1).
 A163595 (program): Numbers k such that prime(k) == 5 (mod 9).
 A163602 (program): First differences of A161753.
 A163606 (program): a(n) = ((3 + 2sqrt(2))(3 + sqrt(2))^n + (3  2sqrt(2))(3  sqrt(2))^n)/2.
 A163607 (program): a(n) = ((5 + 2sqrt(2))(1 + sqrt(2))^n + (5  2sqrt(2))(1  sqrt(2))^n)/2.
 A163608 (program): a(n) = ((5 + 2sqrt(2))(2 + sqrt(2))^n + (5  2sqrt(2))(2  sqrt(2))^n)/2.
 A163609 (program): a(n) = ((5 + 2sqrt(2))(3 + sqrt(2))^n + (5  2sqrt(2))(3  sqrt(2))^n)/2.
 A163613 (program): a(n) = ((1 + 3sqrt(2))(2 + sqrt(2))^n + (1  3sqrt(2))(2  sqrt(2))^n)/2.
 A163614 (program): a(n) = ((1 + 3sqrt(2))(3 + sqrt(2))^n + (1  3sqrt(2))(3  sqrt(2))^n)/2.
 A163615 (program): a(n) = ((1 + 3sqrt(2))(4 + sqrt(2))^n + (1  3sqrt(2))(4  sqrt(2))^n)/2.
 A163617 (program): a(2n) = 2a(n), a(2n + 1) = 2a(n) + 2 + (1)^n, for all n in Z.
 A163627 (program): Numbers n such that 42n + 5 is prime.
 A163637 (program): The sum of all odd numbers from 2n1 to prime(n).
 A163655 (program): a(n) = n(2n^2 + 5*n + 13)/2.
 A163661 (program): a(n) = n(2n^2 + 5*n + 17)/2.
 A163662 (program): A020988 written in base 2.
 A163663 (program): a(0) = 0 and A059153(n1) written in base 2 otherwise.
 A163664 (program): a(n) = 10^(2*n) + 10^n.
 A163671 (program): Expansion of Sum_( x^k / (1  x^(k^2)) ).
 A163673 (program): a(n) = n(2n^2 + 5*n + 15)/2.
 A163675 (program): a(n) = n(2n^2 + 5*n + 19)/2.
 A163683 (program): a(n) = n^2(2n + 5).
 A163695 (program): Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent.
 A163704 (program): Number of n X 2 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent.
 A163714 (program): Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent.
 A163723 (program): Number of nX2 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent
 A163733 (program): Number of n X 2 binary arrays with all 1’s connected, all corners 1, and no 1 having more than two 1’s adjacent.
 A163750 (program): a(n) = (nth even nonprime mod nth prime).
 A163756 (program): 14 times triangular numbers.
 A163758 (program): a(n) = 9n(n+1).
 A163761 (program): a(n) = 10n(n+1).
 A163801 (program): a(n)=na(a(n2)) with a(0)=0,a(1)=1
 A163804 (program): Expansion of (1  x) * (1  x^4) / ((1  x^2) * (1  x^3)) in powers of x.
 A163805 (program): Expansion of (1  x) * (1  x^6) / ((1  x^3) * (1  x^4)) in powers of x.
 A163806 (program): Expansion of (1  x^3) * (1  x^4) / ((1  x) * (1  x^6)) in powers of x.
 A163810 (program): Expansion of (1  x) * (1  x^2) * (1  x^3) / (1  x^6) in powers of x.
 A163811 (program): Expansion of (1  x) * (1  x^10) / ((1  x^5) * (1  x^6)) in powers of x.
 A163812 (program): Expansion of (1  x^5) * (1  x^6) / ((1  x) * (1  x^10)) in powers of x.
 A163815 (program): a(n) = n(2n^2 + 5*n + 3).
 A163817 (program): Expansion of (1  x^2) * (1  x^5) / ((1  x) * (1  x^6)) in powers of x.
 A163818 (program): Expansion of (1  x) * (1  x^6) / ((1  x^2) * (1  x^5)) in powers of x.
 A163827 (program): a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3  2. It may be considered a Fermat near miss by 2.
 A163832 (program): a(n) = n(2n^2 + 5*n + 1).
 A163833 (program): a(n) = n(6n^2 + 15*n + 5)/2.
 A163834 (program): a(n) = (4^n + 5)/3.
 A163839 (program): a(n) = (2^n1)4^(2n1).
 A163864 (program): a(n) = 2*a(n2) for n > 2; a(1) = 1, a(2) = 6.
 A163866 (program): Partial sums of A007318.
 A163868 (program): a(n) = (4^n + 11)/3.
 A163871 (program): The nth composite plus the sum of its nontrivial divisors.
 A163888 (program): a(n) = 2*a(n2) for n > 2; a(1) = 5, a(2) = 4.
 A163943 (program): Third left hand column of triangle A163940.
 A163960 (program): Decimal expansion of 2*(sqrt(2)  1).
 A163978 (program): a(n) = 2*a(n2) for n > 2; a(1) = 3, a(2) = 4.
 A163979 (program): a(n) = n*(n1) + A144437(n+2).
 A163980 (program): a(n) = 2*n + (1)^n.
 A163985 (program): Sum of all isolated parts of all partitions of n.
 A164001 (program): Spiral of triangles around a hexagon.
 A164004 (program): Zero together with row 4 of the array in A163280.
 A164005 (program): Zero together with row 5 of the array in A163280.
 A164006 (program): Zero together with row 6 of the array in A163280.
 A164013 (program): 3 times centered triangular numbers: 9n(n+1)/2 + 3.
 A164015 (program): 5 times centered pentagonal numbers: 5(5n^2 + 5*n + 2)/2.
 A164016 (program): 6 times centered hexagonal numbers: 18n(n+1) + 6.
 A164028 (program): The nth composite minus 3.
 A164033 (program): a(n) = ((4+3sqrt(2))(3+sqrt(2))^n + (43sqrt(2))(3sqrt(2))^n)/4.
 A164037 (program): Expansion of (59x)/(16x+7*x^2).
 A164039 (program): a(n+1) = 3*a(n)  n.
 A164044 (program): a(n+1) = 4*a(n)  n.
 A164045 (program): a(n+1) = 5*a(n)  n.
 A164051 (program): a(n) = 2^(2n) + 2^(n1).
 A164053 (program): Partial sums of A162255.
 A164055 (program): Triangular numbers that are one plus a perfect square.
 A164056 (program): Triangle of 2^n terms by rows, derived from A088696 as to length of continued fractions, lengths increase = 1, decrease = 0. A088696 can be generated using the following algorithm: Rows 0 and 1 begin 1; 1,2; then for all further rows, bring down current row then append to the right: (1 added to each term in current row). Row 2 (1, 2, 3, 2) then becomes: (1, 2, 3, 2, 3, 4, 3, 2).
 A164057 (program): Complement to A164056, change A164056 bits (0>1; 1>0). Provides a coding template for Petoukhov matrices, relating to DNA codons.
 A164072 (program): a(n) = 8a(n1)  14a(n2) for n > 1; a(0) = 1, a(1) = 7.
 A164073 (program): a(n) = 2*a(n2) for n > 2; a(1) = 1, a(2) = 3.
 A164080 (program): Perfect squares one less than a triangular number.
 A164086 (program): Beatty sequence for 4*Pi/3 = 4.1887902… .
 A164087 (program): Beatty sequence for 4Pi/(4Pi3) = 1.3135986… .
 A164089 (program): For n >=4, a(n) = the numerical value of the substring of binary n containing all digits but the first and last. a(1) = a(2) = a(3) = 0.
 A164090 (program): a(n) = 2*a(n2) for n > 2; a(1) = 2, a(2) = 3.
 A164093 (program): 9*4^n+2.
 A164094 (program): a(n) = 3*2^n + 2.
 A164095 (program): a(n) = 2*a(n2) for n > 2; a(1) = 5, a(2) = 6.
 A164096 (program): Partial sums of A164095.
 A164097 (program): Numbers n such that 6n + 7 is a perfect square.
 A164111 (program): Expansion of (1x)/(1+4*x^2).
 A164115 (program): Expansion of (1  x^5) / ((1  x) * (1  x^4)) in powers of x.
 A164116 (program): Expansion of (1  x) * (1  x^4) / (1  x^5) in powers of x.
 A164117 (program): Expansion of (1  x) * (1  x^10) / ((1  x^2) * (1  x^4) * (1  x^5)) in powers of x.
 A164120 (program): Partial sums of A162396.
 A164123 (program): Partial sums of A162436.
 A164131 (program): Numbers n such that n^2 == 2 (mod 31).
 A164135 (program): Numbers k such that k^2 == 2 (mod 47).
 A164136 (program): a(n) = 11n(n+1).
 A164143 (program): Number of binary strings of length n with equal numbers of 001 and 100 substrings
 A164265 (program): Partial sums of A162766.
 A164278 (program): a(n) = (6n + 1)^(2n)  1.
 A164281 (program): Triangle read by rows, a Petoukhov sequence (cf. A164279) generated from (1,2).
 A164284 (program): a(n) = 15*n7.
 A164285 (program): a(n) = 7*2^n + 3.
 A164298 (program): a(n) = ((1+4sqrt(2))(2+sqrt(2))^n + (14sqrt(2))(2sqrt(2))^n)/2.
 A164299 (program): a(n) = ((1+4sqrt(2))(3+sqrt(2))^n + (14sqrt(2))(3sqrt(2))^n)/2.
 A164300 (program): a(n) = ((1+4sqrt(2))(4+sqrt(2))^n + (14sqrt(2))(4sqrt(2))^n)/2.
 A164303 (program): a(n) = 2*a(n1) + a(n2) for n > 1; a(0) = 3, a(1) = 11.
 A164304 (program): a(n) = 4a(n1)  2a(n2) for n > 1; a(0) = 3, a(1) = 14.
 A164305 (program): a(n) = 6a(n1)  7a(n2) for n > 1; a(0) = 3, a(1) = 17.
 A164308 (program): Triangle read by rows, binomial distribution of the terms (1, 3, 9, 27,…)
 A164310 (program): a(n) = 6a(n1)  6a(n2) for n > 1; a(0) = 4, a(1) = 15.
 A164314 (program): Largest prime factor of n^2  2.
 A164315 (program): Number of binary strings of length n with no substrings equal to 000 or 011.
 A164316 (program): Number of binary strings of length n with no substrings equal to 000, 001, or 010.
 A164346 (program): a(n) = 3 * 4^n.
 A164349 (program): The limit of the string “0, 1” under the operation ‘repeat string twice and remove last symbol’.
 A164355 (program): Expansion of (1  x^2)^4 * (1  x^5) / ((1  x)^5 * (1  x^4)^2) in powers of x.
 A164356 (program): Expansion of (1  x^2)^4 / ((1  x)^4 * (1  x^4)) in powers of x.
 A164358 (program): Expansion of (1  x^2)^2 * (1  x^3) / ((1  x)^3 * (1  x^4)) in powers of x.
 A164359 (program): Expansion of (1  x^2)^3 / ((1  x)^3 * (1  x^3)) in powers of x.
 A164360 (program): Period 3: repeat [5, 4, 3].
 A164367 (program): a(n) = A164051(n) in base 2.
 A164386 (program): Numbers which are not 1 larger than a nonzero square.
 A164392 (program): Number of binary strings of length n with no substrings equal to 0001 or 0010.
 A164394 (program): Number of binary strings of length n with no substrings equal to 0001 or 0100.
 A164397 (program): Number of binary strings of length n with no substrings equal to 0001 or 0111.
 A164398 (program): Number of binary strings of length n with no substrings equal to 0001 or 1000.
 A164409 (program): Number of binary strings of length n with no substrings equal to 0000 0001 or 0100
 A164412 (program): Number of binary strings of length n with no substrings equal to 0000 0001 or 0111.
 A164429 (program): Number of binary strings of length n with no substrings equal to 0000, 0011, or 1011.
 A164438 (program): Number of binary strings of length n with no substrings equal to 0000 0110 or 0111
 A164464 (program): Number of binary strings of length n with no substrings equal to 0001, 0100, or 0111.
 A164468 (program): Number of binary strings of length n with no substrings equal to 0001, 0100, or 1110.
 A164482 (program): Number of binary strings of length n with no substrings equal to 0001, 0110, or 1110.
 A164485 (program): Number of binary strings of length n with no substrings equal to 0001, 1000 or 1001.
 A164487 (program): Number of binary strings of length n with no substrings equal to 0001, 1010, or 1100.
 A164494 (program): Number of binary strings of length n with no substrings equal to 0010 0101 or 1010
 A164514 (program): 1 followed by numbers that are not squares.
 A164515 (program): Positive numbers not of the form n^2+2.
 A164532 (program): a(n) = 6*a(n2) for n > 2; a(1) = 1, a(2) = 4.
 A164535 (program): a(n) = 8a(n1)  14a(n2) for n > 1; a(0) = 3, a(1) = 20.
 A164540 (program): a(n) = 4a(n1) + 4a(n2) for n > 1; a(0) = 1, a(1) = 14.
 A164541 (program): a(n) = 6*a(n1)  a(n2) for n > 1; a(0) = 1, a(1) = 15.
 A164542 (program): a(n) = 8a(n1)  8a(n2) for n > 1; a(0) = 1, a(1) = 16.
 A164545 (program): a(n) = 4a(n1) + 4a(n2) for n > 1; a(0) = 1, a(1) = 8.
 A164546 (program): a(n) = 8a(n1)  8a(n2) for n > 1; a(0) = 1, a(1) = 10.
 A164549 (program): a(n) = 4a(n1) + 2a(n2) for n > 1; a(0) = 1, a(1) = 6.
 A164550 (program): a(n) = 6a(n1)  3a(n2) for n > 1; a(0) = 1, a(1) = 7.
 A164559 (program): a(n) = 6^n/3  1.
 A164560 (program): Partial sums of A164532.
 A164576 (program): Integer averages of the set of the first positive squares up to some n^2.
 A164577 (program): Integer averages of the first perfect cubes up to some n^3.
 A164578 (program): Integers of the form (k+1)*(2k+1)/12.
 A164582 (program): a(n) = 5*a(n  1)  a(n  2), with n>2, a(1)=2, a(2)=3.
 A164583 (program): a(n)=4^n*(2n + 1)^2.
 A164587 (program): a(n) = 2*a(n  2) for n > 2; a(1) = 1, a(2) = 8.
 A164591 (program): a(n) = ((4 + sqrt(18))(4 + sqrt(8))^n + (4  sqrt(18))(4  sqrt(8))^n)/8 .
 A164593 (program): a(n) = ((5 + sqrt(18))(2 + sqrt(8))^n + (5  sqrt(18))(2  sqrt(8))^n)/2.
 A164594 (program): a(n) = ((5 + sqrt(18))(4 + sqrt(8))^n + (5  sqrt(18))(4  sqrt(8))^n)/2.
 A164603 (program): a(n) = ((1+4sqrt(2))(2+2sqrt(2))^n + (14sqrt(2))(22sqrt(2))^n)/2.
 A164604 (program): a(n) = ((1+4sqrt(2))(3+2sqrt(2))^n + (14sqrt(2))(32sqrt(2))^n)/2.
 A164605 (program): a(n) = ((1+4sqrt(2))(4+2sqrt(2))^n + (14sqrt(2))(42sqrt(2))^n)/2.
 A164607 (program): a(n) = 4a(n1) + 4a(n2) for n > 1; a(0) = 1, a(1) = 10.
 A164608 (program): Expansion of (1+4x)/(18x+8*x^2).
 A164611 (program): Expansion of (1 + x + 2x^2  x^3)/(1  2x + 3x^2  2x^3 + x^4).
 A164632 (program): a(1)=1 followed by 2^k appearing 2^(2*k1) times for k>0.
 A164640 (program): a(n) = 8*a(n2) for n > 2; a(1) = 1, a(2) = 6.
 A164653 (program): a(1) = 1, for n>=2: a(n) = sum of two consecutive noncomposite numbers A008578.
 A164654 (program): a(n) = 2*a(n2) for n > 2; a(1) = 3, a(2) = 8.
 A164660 (program): Numerators of row sums of triangle of rationals A164658/A164659. Definite integral of Chebyshev polynomials of the first kind: Integral_ x=0..1 T(n,x).
 A164675 (program): a(n) = 8*a(n2) for n > 2; a(1) = 1, a(2) = 12.
 A164682 (program): a(n) = 2*a(n2) for n > 2; a(1) = 5, a(2) = 8.
 A164683 (program): a(n) = 8*a(n2) for n > 2; a(1) = 1, a(2) = 8.
 A164703 (program): a(n) = 8*a(n2) for n > 2; a(1) = 1, a(2) = 16.
 A164737 (program): a(n) = 8*a(n2) for n > 2; a(1) = 5, a(2) = 12.
 A164738 (program): Triangle read by rows. Row 0 = 2 ; left half of row n+1 = row n, right half = row n reversed with each term replaced by the next prime.
 A164740 (program): (2^p(p+2))/p as p runs through the primes.
 A164743 (program): Digital root of 3*A000045(n).
 A164754 (program): Number of n X 2 1..4 arrays with all 1’s connected, all 2’s connected, all 3’s connected, all 4’s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.
 A164765 (program): Partial sums of [A080782^2].
 A164783 (program): 7^n6.
 A164784 (program): a(n) = 6^n5.
 A164785 (program): a(n) = 5^n  4.
 A164786 (program): a(n) = 8^n7.
 A164845 (program): a(n) = (6 + 10n + 5n^2 + n^3)/2.
 A164848 (program): a(n) = A026741(n)/A051712(n+1).
 A164874 (program): Triangle read by rows: T(1,1)=2; T(n,k)=2T(n1,k)+1, 1<=k<n; T(n,n)=2(T(n1,n1)+1).
 A164894 (program): Base10 representation of the binary string formed by appending 10, 100, 1000, 10000, …, etc., to 1.
 A164897 (program): a(n) = 4n(n+1) + 3.
 A164900 (program): a(2n) = 4n(n+1) + 3; a(2n+1) = 2n(n+2) + 3.
 A164907 (program): a(n) = (3*3^n(1)^n)/2.
 A164908 (program): a(n) = (3*4^n  0^n)/2.
 A164910 (program): Partial sums of A088748
 A164931 (program): n times the nth noncomposite.
 A164938 (program): a(n) = (n^5n)/10, which is always an integer.
 A164950 (program): 1 if there is a winning strategy for misère Sprouts with n initial points, else 0.
 A164965 (program): Cumulative sums of A010892.
 A164985 (program): Denominators of ternary BBPtype series for log(5)
 A165020 (program): Length of cycle mentioned in A165019
 A165024 (program): Length of cycle mentioned in A165023
 A165063 (program): Length of cycle mentioned in A165062
 A165130 (program): a(n) = (2^(n+4)1)*(2^n1).
 A165133 (program): a(n) = (2^(n+4)1)*(2^n+1).
 A165145 (program): Partial sums of A058183.
 A165147 (program): a(n) = (3*7^n3^n)/2.
 A165148 (program): a(n) = (3*8^n4^n)/2.
 A165156 (program): n^(2n1)(2n1)^n.
 A165157 (program): Zero followed by partial sums of A133622.
 A165186 (program): Sum(mod(k*(nk),n); k=1,2,..,n)
 A165187 (program): a(n) = n^3(n+1)^2(n+2)/12.
 A165188 (program): Interleaving of A014125 and zero followed by A014125.
 A165189 (program): Partial sums of partial sums of (A001840 interleaved with zeros).
 A165190 (program): G.f.: 1/((1x^4)*(1x^5)).
 A165202 (program): Expansion of (1+x)/(1  x + x^2)^2.
 A165207 (program): Period 4: repeat [2, 2, 4, 4].
 A165211 (program): Period 8: repeat [0,1,0,1,1,0,1,0].
 A165220 (program): Numbers n such that 8*n+1 is a cube.
 A165221 (program): The Padovan sequence analog of the Fibonacci “rabbit” constant binary expansion. Starting with 0 and using the transitions 0>1,1>10,10>01 the subsequences 0,1,10,01,110,1001,01110,1101001,100101110,011101101001… are formed where each subsequence has P sub n ones and length P sub (n1) binary digits, where P sub n is the nth Padovan number. This sequence is the concatenation of all the subsequences. Also note that the nth subsequence is the concatenation of the nth3 and nth2 subsequences.
 A165222 (program): a(n) = (2^(n+4)+1)*(2^n+1).
 A165232 (program): a(0)=1, a(1)=9, a(n)=18a(n1)9a(n2) for n>1 .
 A165233 (program): Signed denominators of terms in series expansion of cos(x)+sin(x).
 A165240 (program): Integers of the form (a+b+c+..+z)/z where (a,b,c,..,z) is a list of 2 or more distinct consecutive nonprimes.
 A165246 (program): a(n) = (10^n + 53)/9
 A165247 (program): a(n) = (10^n + 71)/9.
 A165248 (program): Quintisection A061037(5*n+2).
 A165254 (program): a(n) = 9 + n^17.
 A165257 (program): Triangle in which nth row is binomial(n+k1,k), for column k=1..n.
 A165259 (program): Sum of odd powers of 4 and 9 divided by 13
 A165263 (program): A sequence similar to the Fibonacci rabbit sequence for the Padovan sequence
 A165283 (program): a(n) = (2n + 1)16^n.
 A165310 (program): a(0)=1, a(1)=3, a(n) = 7a(n1)  9a(n2) for n > 1.
 A165311 (program): a(0)=1, a(1)=4, a(n)=9a(n1)16a(n2) for n>1.
 A165314 (program): a(0)=1, a(1)=6, a(n)=13a(n1)36a(n2) for n>1.
 A165326 (program): a(0)=a(1)=1, a(n) = a(n1) for n > 1.
 A165327 (program): E.g.f: Sum_ n>=0 2^(n(n1)) * exp(2^n*x) * x^n/n!.
 A165351 (program): Numerator of 3n/2.
 A165355 (program): a(n) = 3n + 1 if n is even, or a(n) = (3n + 1)/2 if n is odd.
 A165367 (program): Trisection a(n) = A026741(3n + 2).
 A165372 (program): Number of slanted n X 3 (i=1..n) X (j=i..3+i1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, and 4 in the lower right corner.
 A165378 (program): Number of slanted n X 4 (i=1..n) X (j=i..4+i1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.
 A165392 (program): Number of slanted 2 X n (i=1..2) X (j=i..n+i1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.
 A165394 (program): Number of slanted 2 X n (i=1..2) X (j=i..n+i1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 3 neighbors with the same value.
 A165402 (program): a(n) = (10^n*2  11)/9.
 A165443 (program): a(n) = ( 16^(2n+1) + 81^(2n+1) )/97.
 A165453 (program): Linear interpolation of the sequence that maps an entry of A002378 to the corresponding entry of A006331.
 A165457 (program): a(n) = (2n+1)!(2*n+3)/3.
 A165479 (program): a(n) = Least i in range [A165478(n),A165478(n+1)] for which abs(A165477(i)) gets the maximum value in that range.
 A165518 (program): Perfect squares (A000290) that can be expressed as the sum of four consecutive triangular numbers (A000217).
 A165520 (program): Antidiagonal writing from three rows trio A165351,A165355,A165367 (first,second and third trisections of A026741).
 A165553 (program): a(n) = (3/2)*(1+(3)^(n1)).
 A165556 (program): A symmetric version of the Josephus problem read modulo 2.
 A165560 (program): The arithmetic derivative of n, modulo 2.
 A165563 (program): a(n) = 1 + 2n + n^2 + 2n^3 + n^4.
 A165568 (program): a(n) = 1  2n + n^2 + 2n^3 + n^4.
 A165618 (program): Binomial(n+8,8)1
 A165622 (program): a(n)=(4)*a(n1)+8 with a(0)=1.
 A165625 (program): a(n)=(5/3)(1+2(5)^(n1)).
 A165638 (program): a(n)=(6/7)(2+5(6)^(n1)).
 A165639 (program): a(n)=(7/4)(1+3(7)^(n1)).
 A165640 (program): Number of distinct multisets of n integers, each of which is 2, +1, or +3, such that the sum of the members of each multiset is 3.
 A165662 (program): Period 5: repeat 4,4,8,6,8.
 A165663 (program): Decimal expansion of 3 + sqrt(3).
 A165664 (program): First digit of the decimal expansion of (n^22)/7 after the decimal point.
 A165665 (program): a(n) = (3*2^n  2) * 2^n.
 A165669 (program): First digit of the decimal expansion of (n^2+2)/7 after the decimal point.
 A165676 (program): Fourth right hand column of triangle A165674
 A165677 (program): Fifth right hand column of triangle A165674
 A165678 (program): Sixth right hand column of triangle A165674
 A165679 (program): Seventh right hand column of triangle A165674
 A165717 (program): Integers of the form k*(5+k)/4.
 A165718 (program): Integers of the form k*(k+7)/6.
 A165719 (program): Integers of the form k*(k+9)/8.
 A165720 (program): Integers of the form k*(k+11)/10.
 A165721 (program): Integers of the form k*(k+13)/12.
 A165734 (program): Period 2: repeat 6,30.
 A165735 (program): Surviving integers under the doublecount Josephus problem (see A054995), modulo 3.
 A165743 (program): The greatest common divisor of n and 210.
 A165746 (program): a(n) = 3  2*3^n.
 A165747 (program): a(n) = 12n.
 A165748 (program): a(n) = (8/9)(2+7(8)^(n1)).
 A165749 (program): a(n) = (9/5)(1+4(9)^(n1)).
 A165750 (program): a(n) = (10/11)(2+9(10)^(n1)).
 A165751 (program): a(n) = 4  3*2^n.
 A165752 (program): a(n) = (85*4^n)/3.
 A165754 (program): a(n) = nimsum(n+(n+1)+(n+2)).
 A165755 (program): a(n) = (53*5^n)/2.
 A165758 (program): a(n) = (127*6^n)/5.
 A165759 (program): a(n) = (74*7^n)/3.
 A165760 (program): a(n) = (169*8^n)/7.
 A165775 (program): n + (least square >= n), i.e., n + A048761(n).
 A165776 (program): n + (least square > n), i.e., n + A048761(n+1).
 A165792 (program): a(0)=1, a(n)=n*(a(n1)+2).
 A165793 (program): a(0)=1, a(n)=n*(a(n1)2).
 A165798 (program): a(n) = 65*n^2.
 A165800 (program): Powers of 50.
 A165801 (program): f(n), f(f(n)), … are all prime, where f(n) = (n1)/2. Stop when f(…f(n)…) is less than 4.
 A165804 (program): Numbers of the form i*8^j1 (i=1..7, j >= 0).
 A165806 (program): a(n) = 15n^2 + 3n + 1.
 A165813 (program): a(n) = n*(a(n1)+3), a(0)=1.
 A165814 (program): a(n)=n*(a(n1)3), a(0)=1.
 A165817 (program): Number of compositions (= ordered integer partitions) of n into 2n parts.
 A165824 (program): Totally multiplicative sequence with a(p) = 3.
 A165825 (program): Totally multiplicative sequence with a(p) = 4.
 A165826 (program): Totally multiplicative sequence with a(p) = 5.
 A165827 (program): Totally multiplicative sequence with a(p) = 6.
 A165828 (program): Totally multiplicative sequence with a(p) = 7.
 A165829 (program): Totally multiplicative sequence with a(p) = 8.
 A165830 (program): Totally multiplicative sequence with a(p) = 9.
 A165831 (program): Totally multiplicative sequence with a(p) = 10.
 A165832 (program): Totally multiplicative sequence with a(p) = 11.
 A165833 (program): Totally multiplicative sequence with a(p) = 12.
 A165834 (program): Totally multiplicative sequence with a(p) = 13.
 A165835 (program): Totally multiplicative sequence with a(p) = 14.
 A165836 (program): Totally multiplicative sequence with a(p) = 15.
 A165837 (program): Totally multiplicative sequence with a(p) = 16.
 A165838 (program): Totally multiplicative sequence with a(p) = 17.
 A165839 (program): Totally multiplicative sequence with a(p) = 18.
 A165840 (program): Totally multiplicative sequence with a(p) = 19.
 A165841 (program): Totally multiplicative sequence with a(p) = 20.
 A165842 (program): Totally multiplicative sequence with a(p) = 21.
 A165843 (program): Totally multiplicative sequence with a(p) = 22.
 A165844 (program): Totally multiplicative sequence with a(p) = 23.
 A165845 (program): Totally multiplicative sequence with a(p) = 24.
 A165846 (program): Totally multiplicative sequence with a(p) = 25.
 A165847 (program): Totally multiplicative sequence with a(p) = 26.
 A165848 (program): Totally multiplicative sequence with a(p) = 27.
 A165849 (program): Totally multiplicative sequence with a(p) = 28.
 A165850 (program): Totally multiplicative sequence with a(p) = 29.
 A165851 (program): Totally multiplicative sequence with a(p) = 30.
 A165852 (program): Totally multiplicative sequence with a(p) = 31.
 A165853 (program): Totally multiplicative sequence with a(p) = 32.
 A165854 (program): Totally multiplicative sequence with a(p) = 33.
 A165855 (program): Totally multiplicative sequence with a(p) = 34.
 A165856 (program): Totally multiplicative sequence with a(p) = 35.
 A165857 (program): Totally multiplicative sequence with a(p) = 36.
 A165858 (program): Totally multiplicative sequence with a(p) = 37.
 A165859 (program): Totally multiplicative sequence with a(p) = 38.
 A165860 (program): Totally multiplicative sequence with a(p) = 39.
 A165861 (program): Totally multiplicative sequence with a(p) = 40.
 A165862 (program): Totally multiplicative sequence with a(p) = 41.
 A165863 (program): Totally multiplicative sequence with a(p) = 42.
 A165864 (program): Totally multiplicative sequence with a(p) = 43.
 A165865 (program): Totally multiplicative sequence with a(p) = 44.
 A165866 (program): Totally multiplicative sequence with a(p) = 45.
 A165867 (program): Totally multiplicative sequence with a(p) = 46.
 A165868 (program): Totally multiplicative sequence with a(p) = 47.
 A165869 (program): Totally multiplicative sequence with a(p) = 48.
 A165870 (program): Totally multiplicative sequence with a(p) = 49.
 A165871 (program): Totally multiplicative sequence with a(p) = 50.
 A165872 (program): Totally multiplicative sequence with a(p) =  2.
 A165897 (program): a(n) = a(n1) + largest proper divisor of a(n1), a(1)=4.
 A165900 (program): Values of Fibonacci polynomial n^2  n  1.
 A165907 (program): Minimal m for packing the first n primes in a prime(n) X m rectangle
 A165943 (program): Heptasection A061037(7*n+2).
 A165958 (program): The digits on a number pad from lower right to upper left.
 A165972 (program): Nonprimes k such that the sum of the smallest and largest divisor of k is prime.
 A165983 (program): Period 16: repeat 1,1,1,2,1,1,1,2,1,1,1,4,1,1,1,4.
 A165984 (program): Number of ways to put n indistinguishable balls into n^3 distinguishable boxes.
 A165988 (program): First trisection of A022998.
 A165993 (program): a(n) = sum_ j=1..prime(n)1 floor (j^2/prime(n)).
 A165994 (program): a(n) is the number of nonzero values of floor (j^2/prime(n)), over 1 <= j < prime(n).
 A165998 (program): Denominators of Taylor series expansion of 1/(3x)log((1+x)/(1x)^2)
 A166010 (program): a(n) = prime(n)^24.
 A166011 (program): Least common multiple of prime(n)3 and prime(n)+3.
 A166012 (program): a(n) = 2*(A000045(n)(n mod 2)) + 1 + (n mod 2).
 A166021 (program): a(n) = 2*A000124(A003056(n1)) if A002262(n1)=0, otherwise a(n1)+1.
 A166023 (program): a(n) = 6*a(n2) for n > 2; a(1) = 1, a(2) = 5.
 A166024 (program): Define dsf(n) = A045503(n) = n_1^ n_1 +n_2^ n_2 +n_3^ n_3 + n_m^ n_m , where n_1,n_2,n_3,…n_m is the list of the decimal digits of n. dsf(421845123) = 16780890 and dsf(16780890) = 421845123, so these 2 numbers make a loop for the function dsf.
 A166025 (program): a(0) = 6, a(1) = 17, a(n+1) = a(n) + a(n1) for n>0.
 A166027 (program): a(n) = 6*a(n2) for n > 2; a(1) = 4, a(2) = 1.
 A166033 (program): a(n) = 11/4 +11n/2 + 29(1)^n/4.
 A166060 (program): 43^n  32^n.
 A166065 (program): Triangle, read by rows, given by [0,1,1,0,0,0,0,0,0,0,…] DELTA [2,1,0,0,0,0,0,0,0,…] where DELTA is the operator defined in A084938.
 A166074 (program): a(n) = n^2  [largest Fibonacci number <= n^2].
 A166077 (program): a(n)=2^(n(3n1)/2).
 A166079 (program): Given a row of n payphones, all initially unused, how many people can use the payphones, assuming (1) each always chooses one of the most distant payphones from those in use already, (2) the first person takes a phone at the end, and (3) no people use adjacent phones?
 A166114 (program): a(n) = (6(4)^n)/5.
 A166117 (program): a(0)=0, a(1)=1, a(2)=2 and a(n) = a(n1)  2a(n2) + a(n3).
 A166118 (program): Fixed points of the mapping f(x) = (x + 2^x) mod (17 + x).
 A166122 (program): a(n) = (7(5)^n)/6.
 A166124 (program): Triangle, read by rows, given by [0,1/2,1/2,0,0,0,0,0,0,0,…] DELTA [2,1,0,0,0,0,0,0,0,0,…] where DELTA is the operator defined in A084938.
 A166127 (program): Minimum value of j such that floor(j^2 / prime(n)) > 0.
 A166132 (program): a(n) = 1 + (49^n  94^n) / 5.
 A166136 (program): a(n) = n*(n+3)/2 + 7.
 A166137 (program): a(n) = 5n(n+1)/2  4.
 A166138 (program): Trisection A022998(3n+1).
 A166143 (program): a(n) = 3n^2 + 3n  5.
 A166144 (program): a(n) = (11n^2 + 11n  20)/2.
 A166146 (program): a(n) = (7n^2 + 7n  12)/2.
 A166147 (program): a(n) = 4n^2 + 4n  7.
 A166148 (program): a(n) = (9n^2 + 9n  16)/2.
 A166150 (program): a(n) = 5n^2 + 5n  9.
 A166151 (program): (5n^2 + 5n  6)/2.
 A166154 (program): 7n(n+1)/2  5.
 A166169 (program): a(n) = Lucas(n^2) = A000204(n^2) for n >= 1.
 A166189 (program): Number of 3 X 3 X 3 triangular nonnegative integer arrays with all sums of an element and its neighbors <= n.
 A166242 (program): Sequence generated from A014577, the dragon curve.
 A166250 (program): a(n) = n1 plus the largest proper divisor of n.
 A166253 (program): String substitution 0 > 01110, 1 > 10001, started with 1.
 A166257 (program): Odd numbers not of the form prime(k) + phi(prime(k)).
 A166260 (program): a(n) = A089026(n)  1.
 A166267 (program): Number of 1’s in the binary representation of A000129(n).
 A166304 (program): Third trisection of A022998.
 A166312 (program): Number of 1’s in binary expansion of A000326(n).
 A166314 (program): Number of 1’s in binary expansion of A000124(n).
 A166329 (program): Products of squares of 2 successive primes.
 A166336 (program): Expansion of (1  4x + 7x^2  4x^3 + x^4)/(1  7x + 17x^2  17x^3 + 7*x^4  x^5).
 A166337 (program): a(n)=(2n+0^n)*C(4n,2n).
 A166338 (program): a(n) = (4*n)!/n!.
 A166350 (program): Table T(n,m) = m! read by rows.
 A166356 (program): Expansion of e.g.f. 1 + x*arctanh(x), even powers only.
 A166361 (program): Scale degrees of the roots of chords in a traditional “twelvebar blues” in Western music.
 A166362 (program): a(n) = phi(nonprime(n)).
 A166375 (program): a(n) = sum (floor (j^2/n)) taken over 1 <= j <= n1.
 A166381 (program): a(n) = Sum_ j>n floor(n^2/j).
 A166444 (program): a(0) = 0, a(1) = 1 and for n > 1, a(n) = sum of all previous terms.
 A166445 (program): Hankel transform of A025276.
 A166446 (program): Period 12: repeat [1,1,1,1,0,0,1,1,1,1,0,0].
 A166447 (program): a(n) = n*round(sqrt(n)).
 A166450 (program): a(n) = 3*a(n2) for n > 2; a(1) = 1, a(2) = 6.
 A166460 (program): Numbers k such that k + (1)^k is not prime.
 A166464 (program): a(n) = (3+2n+6n^2+4n^3)/3.
 A166465 (program): a(n) = 3*a(n2) for n > 2; a(1) = 1, a(2) = 5.
 A166466 (program): Trisection a(n) = A000265(3n).
 A166470 (program): 2^F(n+1)*3^F(n), where F(n) is the nth Fibonacci number (A000045(n)).
 A166481 (program): a(n) = 3*a(n2) for n > 2; a(1) = 1; a(2) = 7.
 A166486 (program): Periodic sequence [0,1,1,1] of length 4.
 A166496 (program): Prime plus the next composite.
 A166514 (program): Zigzag function for first two columns of a matrix (take numbers in consecutive pairs).
 A166515 (program): Partial sum of A166514.
 A166516 (program): A product of consecutive doubled Fibonacci numbers.
 A166517 (program): a(n) = (3 + 5(1)^n + 6n)/4.
 A166519 (program): a(n) = 1 + 2(1)^n + 2n.
 A166520 (program): a(n) = (10n + 11(1)^n + 5)/4.
 A166521 (program): a(n) = (6n + 7(1)^n + 3)/2.
 A166522 (program): a(n) = 7*n  a(n1), with a(1) = 1.
 A166523 (program): a(n) = 8*n  a(n1), with n>1, a(1)=1.
 A166524 (program): a(n) = 9*n  a(n1), with n>1, a(1)=1.
 A166525 (program): a(n) = 10*n  a(n1), with n>1, a(1)=1.
 A166526 (program): a(n) = 12*n  a(n1), with n>1, a(1)=1.
 A166536 (program): A product of consecutive doubled Fibonacci numbers.
 A166539 (program): a(n) = (10n + 7(1)^n + 5)/4.
 A166542 (program): a(n) = 6*n  a(n1), with n>1, a(1)=2.
 A166544 (program): a(n) = 7*n  a(n1), with n>1, a(1)=2.
 A166545 (program): a(n) = 13*n  a(n1), (with a(1)=13).
 A166549 (program): The number of halving steps of the Collatz 3x+1 map to reach 1 starting from 2n1.
 A166552 (program): a(n) = 3*a(n2) for n > 2; a(1) = 1; a(2) = 4.
 A166554 (program): a(0)=1, a(n) = n*(a(n1)1) for n>0.
 A166577 (program): Inverse binomial transform of A166517.
 A166578 (program): a(n) = a(n3) + 2^(n4) with a(1) = 1, a(2) = 2, a(3) = 1.
 A166586 (program): Totally multiplicative sequence with a(p) = p  2 for prime p.
 A166588 (program): Partial sums of A097331; binomial transform of A166587.
 A166590 (program): Totally multiplicative sequence with a(p) = p+2 for prime p.
 A166591 (program): Totally multiplicative sequence with a(p) = p+3 for prime p.
 A166598 (program): a(n) = 5*n  a(n1), with n>1, a(1)=5.
 A166621 (program): a(n) = 10*n  a(n1), with n>1, a(1)=5.
 A166624 (program): Totally multiplicative sequence with a(p) = 3p for prime p.
 A166625 (program): Totally multiplicative sequence with a(p) = 4p for prime p.
 A166626 (program): Totally multiplicative sequence with a(p) = 5p for prime p.
 A166627 (program): Totally multiplicative sequence with a(p) = 6p for prime p.
 A166628 (program): Totally multiplicative sequence with a(p) = 7p for prime p.
 A166629 (program): Totally multiplicative sequence with a(p) = 8p for prime p.
 A166630 (program): Totally multiplicative sequence with a(p) = 9p for prime p.
 A166631 (program): Totally multiplicative sequence with a(p) = 10p for prime p.
 A166639 (program): a(n) = 6n + 3 + 4(1)^n.
 A166677 (program): a(n)= n*(a(n1)+4), a(0)=1.
 A166680 (program): a(n) = n*(a(n1)4), a(0) = 1.
 A166698 (program): Totally multiplicative sequence with a(p) = a(p1)  1 for prime p.
 A166711 (program): Permutation of the integers: two positives, one negative.
 A166725 (program): a(n) = (2n+1)25^n.
 A166727 (program): Positive integers with English names ending in “r”.
 A166728 (program): Positive integers with English names ending in “x”.
 A166729 (program): Positive integers with English names ending in “t”.
 A166730 (program): Positive integers with English names ending in “y”.
 A166731 (program): Positive integers with English names ending in “d”.
 A166750 (program): a(n) = (A001147(n))^3 = 2^(3n)GAMMA(n+1/2)^3/Pi^(3/2).
 A166752 (program): Interleave A007583 and A000012.
 A166753 (program): Partial sums of A166752.
 A166754 (program): a(n) = 4A061547(n+1)  3A166753(n).
 A166756 (program): Number of nX2 1..3 arrays containing at least one of each value, and all equal values connected.
 A166761 (program): Number of nX3 1..2 arrays containing at least one of each value, and all equal values connected.
 A166776 (program): Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.
 A166781 (program): Number of nX3 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.
 A166796 (program): Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
 A166805 (program): Number of n X 4 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
 A166808 (program): Number of n X 5 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
 A166810 (program): Number of n X 6 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
 A166812 (program): Number of n X 7 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
 A166813 (program): Number of n X 8 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.
 A166814 (program): Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.
 A166830 (program): Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.
 A166863 (program): a(1)= 1; a(2)= 5; thereafter a(n)= a(n1) + a(n2) + 5.
 A166866 (program): Mixed fractal sequence mf(n). Mix fractals A158405, A002260.
 A166873 (program): a(n) = a(n1) + 12*n for n > 1; a(1) = 1.
 A166876 (program): a(n) = a(n1) + Fibonacci(n), a(1)=1983.
 A166911 (program): a(n) = (9 + 14n + 12n^2 + 4*n^3)/3.
 A166914 (program): a(n) = 20a(n1)  64a(n2) for n > 1; a(0) = 21, a(1) = 340.
 A166916 (program): a(n) = 20a(n1)  64a(n2)  15 for n > 1; a(0) = 357, a(1) = 5525.
 A166917 (program): a(n) = 20a(n1)  64a(n2) for n > 1; a(0) = 85, a(1) = 1364.
 A166918 (program): Triangle T(n,k) read by rows: T(n,0) = n mod 2. T(n,k) = 2^(k1), 0<k<=n.
 A166920 (program): a(n) = 2^n  (1 + (1)^n)/2.
 A166923 (program): Digital root of prime(n)^2.
 A166925 (program): Digital root of square of nth triangular number.
 A166926 (program): A000004 preceded by 1, 2, 4.
 A166927 (program): a(n) = 20a(n1)  64a(n2) for n > 1; a(0) = 1, a(1) = 18.
 A166931 (program): Numbers n with property that n mod k is k1 for all k = 2..9.
 A166941 (program): Product plus sum of four consecutive nonnegative numbers.
 A166942 (program): One fifth of product plus sum of five consecutive nonnegative numbers.
 A166946 (program): a(n) = 1 if n is a rounded multiple of Phi (1.618033989…), the larger golden ratio value; else a(n) = 0
 A166956 (program): a(n) = 2^n +(1)^n  2.
 A166957 (program): a(n) = 841n^3 + 261n^2 + 28*n + 1.
 A166959 (program): Numbers congruent to (12,32) mod 44.
 A166965 (program): a(n) = 20a(n1)  64a(n2) for n > 1; a(0) = 1, a(1) = 19.
 A166977 (program): JacobsthalLucas numbers A014551, except a(0) = 0.
 A166978 (program): a(n) = 4*( 1(1)^n) 2^n.
 A166983 (program): The nth composite minus the number of its divisors.
 A166984 (program): a(n) = 20a(n1)  64a(n2) for n > 1; a(0) = 1, a(1) = 20.
 A167020 (program): a(n) = 1 iff 6n1 is prime.
 A167021 (program): a(n) = 1 iff 6n+1 is prime.
 A167030 (program): a(n) = (2^n  (1)^n  3)/3.
 A167033 (program): a(n) = 20a(n1)  64a(n2) + 3 for n > 1; a(0) = 1, a(1) = 22.
 A167055 (program): Numbers n such that 12*n + 5 is prime.
 A167056 (program): Numbers n such that 12*n + 7 is prime.
 A167057 (program): Numbers n such that 12*n + 11 is prime.
 A167136 (program): a(n) = b(n)th highest positive integer not equal to any a(k), 1 <= k <= n1, where b(n) = noncomposite numbers = A008578(n).
 A167149 (program): 10000gonal numbers: a(n) = n + 4999 * n * (n1).
 A167153 (program): Numbers not appearing in A167152.
 A167155 (program): Exponential primorial constant sum( 1/A140319(k), k>=0 )
 A167166 (program): a(n) = n^7 mod 16.
 A167167 (program): A001045 with a(0) replaced by 1.
 A167176 (program): n^3 mod 9.
 A167179 (program): The number of additional armies one receives in Parker Brothers’ (now part of Hasbro) game of Risk for turning in the nth set of three different or alike cards.
 A167185 (program): Largest prime power <= n that is not prime.
 A167193 (program): a(n) = (1/3)(1  (2)^n + 3(1)^n ) = (1)^(n+1)*A167030(n).
 A167194 (program): Triangle read by rows. A130713 in the columns.
 A167204 (program): Triangle read by rows in which row n lists the first 2^(n1) terms of A003602.
 A167205 (program): a(n) = (3^n+1)/(3(1)^n).
 A167214 (program): a(n) = (sum of first n primes) * n.
 A167238 (program): Number of ways to partition a 2*n X 2 grid into 4 connected equalarea regions
 A167268 (program): Janet’s sequence: Number of elements for each successively filled electronic subshell of an atom.
 A167270 (program): a(n) = Fibonacci(n + 2) + floor(n/2).
 A167275 (program): Row sums of triangle A167274 (a variant of Gould’s sequence A001316).
 A167280 (program): Period length 12: 0,0,1,2,4,7,4,8,7,4,8,5 (and repeat).
 A167291 (program): a(n) = A137505(2n) + A137505(2n+1).
 A167339 (program): Totally multiplicative sequence with a(p) = p*(p2) = p^22p for prime p.
 A167340 (program): Totally multiplicative sequence with a(p) = p*(p+2) = p^2+2p for prime p.
 A167342 (program): Totally multiplicative sequence with a(p) = p*(p+3) = p^2+3p for prime p.
 A167343 (program): Totally multiplicative sequence with a(p) = (p1)^2 = p^22p+1 for prime p.
 A167349 (program): Totally multiplicative sequence with a(p) = (p+1)^2 = p^2+2p+1 for prime p.
 A167354 (program): Totally multiplicative sequence with a(p) = (p2)^2 = p^24p+4 for prime p.
 A167358 (program): Totally multiplicative sequence with a(p) = (p+2)^2 = p^2+4p+4 for prime p.
 A167363 (program): Totally multiplicative sequence with a(p) = (p+3)^2 = p^2+6p+9 for prime p.
 A167371 (program): Triangle, read by rows, given by [0,1,1,0,0,0,0,0,0,0,0,…] DELTA [1,0,1,1,0,0,0,0,0,0,0,…] where DELTA is the operator defined in A084938.
 A167373 (program): Expansion of (1+x)(3x+1)/(1+x+x^2).
 A167374 (program): Triangle, read by rows, given by [ 1,1,0,0,0,0,0,0,0,…] DELTA [1,0,0,0,0,0,0,0,0,…] where DELTA is the operator defined in A084938.
 A167375 (program): a(n)=3*a(n1)a(n2) with a(0)=1, a(1)=3, a(2)=11.
 A167381 (program): The numbers read down the leftcenter column of an arrangement of the natural numbers in square blocks.
 A167385 (program): a(n)= sum_ i=7..n+6 A000931(i).
 A167386 (program): a(n) = (1)^nn(n+1)(2n5)/6.
 A167387 (program): a(n) = (1)^(n+1) * n(n1)(n4)*(n+1)/12.
 A167398 (program): a(n) = Fibonacci(11*n).
 A167407 (program): T(m,n) is m if n=0, 1 elsewhere.
 A167420 (program): 2^n mod 14.
 A167421 (program): 2^n mod 22.
 A167422 (program): Expansion of (1+x)*c(x), c(x) the g.f. of A000108.
 A167423 (program): Hankel transform of a simple Catalan convolution.
 A167425 (program): 2^n mod 26.
 A167426 (program): a(n) = 2^n mod 28.
 A167430 (program): Fractal sequence of the interspersion A163255.
 A167436 (program): 3rd Fibonacci polynomial evaluated at n^n.
 A167444 (program): Fibonacci(n)!!.
 A167463 (program): a(n) = n mod 15.
 A167465 (program): n^5 mod 16.
 A167467 (program): a(n) = 25n^3  n(5*n+1)/2 + 1.
 A167469 (program): a(n) = 3n(5*n1)/2.
 A167471 (program): Janet periodic table of the elements and structured hexagonal diamond numbers. a(n) = A166911(2n) + A166911(2n+1).
 A167477 (program): Expansion of (13x+5x^2x^3)/(13x+x^2)^2.
 A167478 (program): Expansion of (12x+6x^2x^3)/(13x+x^2)^2.
 A167482 (program): a(n)=n1 if n is prime, otherwise a(n)=n+1.
 A167484 (program): For n people on one side of a river, the number of ways they can all travel to the opposite side following the pattern of 2 sent, 1 returns, 2 sent, 1 returns, …, 2 sent.
 A167487 (program): a(n) = n*(n + 3)/2 + 8.
 A167498 (program): a(n) = 6+32n^2+8n(7+8n^2)/3.
 A167499 (program): a(n) = n*(n+3)/2 + 6.
 A167520 (program): Positions of nonzero digits in this sequence, when all terms are concatenated.
 A167527 (program): n^5 mod 49.
 A167528 (program): a(n) = n^5 mod 50.
 A167533 (program): a(n) = 71*n  a(n1) for n>0, a(0)=12.
 A167534 (program): a(n) = 79*n  a(n1) for n>0, a(0)=9.
 A167541 (program): a(n) = (n  4)(n  5)(n  12)/6.
 A167543 (program): a(n) = (n5)(n6)(n7)*(n16)/24.
 A167544 (program): a(n) = (n3)*(n8)/2 .
 A167545 (program): n^6 mod 16.
 A167547 (program): The fourth row of the ED1 array A167546.
 A167548 (program): The fifth row of the ED1 array A167546
 A167549 (program): The sixth row of the ED1 array A167546.
 A167554 (program): The second left hand column of triangle A167552.
 A167558 (program): The second right hand column of triangle A167557.
 A167561 (program): The fourth row of the ED2 array A167560.
 A167562 (program): The fifth row of the ED2 array A167560.
 A167570 (program): The third right hand column of triangle A167569.
 A167573 (program): The third row of the ED3 array A167572.
 A167574 (program): The fourth row of the ED3 array A167572.
 A167575 (program): The fifth row of the ED3 array A167572.
 A167585 (program): a(n) = 12n^2  8n + 9.
 A167586 (program): The fourth row of the ED4 array A167584.
 A167592 (program): The second left hand column of triangle A167591.
 A167614 (program): (n^2 + 3*n + 8)/2.
 A167616 (program): a(n) = Fibonacci(n)  5.
 A167622 (program): n^3 mod nth prime.
 A167624 (program): a(n) = n^6 mod 32.
 A167628 (program): n^11 mod 13.
 A167632 (program): Smallest m such that A033183(m) = n.
 A167657 (program): Product of nth block of identical consecutive values of A000720.
 A167667 (program): Expansion of (1x+4x^2)/(12x)^2.
 A167682 (program): Expansion of (1  2x + 5x^2) / (1  3*x)^2.
 A167744 (program): Squares that become a prime number when some single digit is inserted in front of its decimal expansion.
 A167747 (program): a(n) = phi(6^n).
 A167808 (program): Numerator of x(n) = x(n1) + x(n2), x(0)=0, x(1)=1/2.
 A167816 (program): Numerator of x(n) = x(n1) + x(n2), x(0)=0, x(1)=1/3; denominator=A167817.
 A167817 (program): Period 4: repeat [1, 3, 3, 3].
 A167821 (program): a(n) is the number of ntosses having a run of 3 or more heads or a run of 3 or more tails for a fair coin (i.e., probability is a(n)/2^n).
 A167873 (program): Period 4: repeat [10, 6, 10, 4].
 A167875 (program): One third of product plus sum of three consecutive nonnegative integers; a(n)=(n+1)(n^2+2n+3)/3.
 A167876 (program): A000004 preceded by 1, 3, 4, 2.
 A167877 (program): Largest m<=n such that no carry occurs when adding m to n in ternary arithmetic.
 A167878 (program): A167877(n) + n.
 A167891 (program): A000004 preceded by 1, 4, 2.
 A167892 (program): a(n) = Sum_ k=1..n Catalan(k)^2.
 A167963 (program): a(n) = n*(n^5 + 1)/2.
 A167991 (program): Blocks of size 2n, each with 2n1 replicas of 2n followed by 2n+1; n=1, 2, 3, …
 A167993 (program): Expansion of x^2/((3x1)(3*x^21)).
 A167998 (program): Numbers n with property that first digit of 5*n = last digit of n.
 A168010 (program): a(n) = Sum of all numbers of divisors of all numbers k such that n^2 <= k < (n+1)^2.
 A168011 (program): a(n) = Sum of all numbers of divisors of all numbers < (n+1)^2.
 A168014 (program): Sum of all parts of all partitions of n into equal parts that do not contain 1 as a part.
 A168029 (program): n*(n^6+1)/2.
 A168036 (program): Difference between n’ and n, where n’ is the arithmetic derivative of n (A003415).
 A168037 (program): Period length 18: repeat 0,1,2,0,8,7,0,4,5,0,5,4,0,7,8,0,2,1.
 A168038 (program): Squares closest to 2*n.
 A168039 (program): Squares closest to 3*n.
 A168043 (program): Let S(1)= 1 and, for n>1 let S(n) be the smallest set containing x+1, x+2, and 2*x for each element x in S(n1). a(n) is the number of elements in S(n).
 A168046 (program): Characteristic function of zerofree numbers in decimal representation.
 A168048 (program): a(n) = C(n)*Pi(n) where C(n) = number of nonprimes <= n, Pi(n) = number of primes <= n.
 A168050 (program): Hankel transform of A168049.
 A168052 (program): Hankel transform of a Motzkin variant.
 A168053 (program): Expansion of (12x^23x^3)/((1x)^2*(1+x+x^2)).
 A168056 (program): Expansion of (1+2x^2+x^3)/((1x)^2(1+x+x^2)).
 A168057 (program): Expansion of (1+8x^2+8x^3)/((12x)^2*(1+2x+4x^2)).
 A168059 (program): Denominator of (n+2)/(n*(n+1)).
 A168067 (program): n*(n^7+1)/2.
 A168071 (program): Expansion of (13x^24x^3)/((1x)^2*(1+x+x^2)).
 A168077 (program): a(2n) = A129194(2n)/2; a(2n+1) = A129194(2n+1).
 A168090 (program): a(n) = (1  (n mod 3) mod 2)*2^(floor(n/3) + (n mod 3)/2 ).
 A168092 (program): a(n) = number of natural numbers m such that n  2 <= m <= n + 2.
 A168093 (program): a(n) = number of natural numbers m such that n  3 <= m <= n + 3.
 A168094 (program): a(n) = number of natural numbers m such that n  4 <= m <= n + 4.
 A168095 (program): a(n) = number of natural numbers m such that n  5 <= m <= n + 5.
 A168096 (program): a(n) = number of natural numbers m such that n  6 <= m <= n + 6.
 A168097 (program): a(n) = number of natural numbers m such that n  7 <= m <= n + 7.
 A168098 (program): a(n) = number of natural numbers m such that n  8 <= m <= n + 8.
 A168099 (program): a(n) = number of natural numbers m such that n  9 <= m <= n + 9.
 A168100 (program): a(n) = number of natural numbers m such that n  10 <= m <= n + 10.
 A168101 (program): a(n) = sum of natural numbers m such that n  2 <= m <= n + 2.
 A168102 (program): a(n) = sum of natural numbers m such that n  3 <= m <= n + 3.
 A168103 (program): a(n) = sum of natural numbers m such that n  4 <= m <= n + 4.
 A168104 (program): a(n) = sum of natural numbers m such that n  5 <= m <= n + 5.
 A168105 (program): a(n) = sum of natural numbers m such that n  6 <= m <= n + 6.
 A168106 (program): a(n) = sum of natural numbers m such that n  7 <= m <= n + 7.
 A168107 (program): a(n) = sum of natural numbers m such that n  8 <= m <= n + 8.
 A168108 (program): a(n) = sum of natural numbers m such that n  9 <= m <= n + 9.
 A168109 (program): a(n) = sum of natural numbers m such that n  10 <= m <= n + 10.
 A168116 (program): a(n) = n*(n^8+1)/2.
 A168118 (program): n*(n^9+1)/2.
 A168119 (program): n*(n^10+1)/2.
 A168122 (program): n^2*(n^4+1)/2.
 A168123 (program): n^2*(n^5+1)/2.
 A168124 (program): a(n) = n^2*(n^6+1)/2.
 A168125 (program): a(n) = n^2*(n^7+1)/2.
 A168126 (program): a(n) = n^2*(n^8+1)/2.
 A168143 (program): a(17)=37; for n>=17, a(n)=3n14 if gcd(n,a(n1))>1 and all prime divisors of n more than 17; a(n)=a(n1)+1, otherwise
 A168150 (program): Inverse binomial transform of A026741.
 A168152 (program): a(n) = prime(prime(n))  prime(n).
 A168153 (program): a(n) = n^2*(n^9 + 1)/2.
 A168176 (program): a(n) = n^2*(n^10 + 1)/2.
 A168178 (program): a(n) = n^3*(n^2 + 1)/2.
 A168179 (program): a(n) = n^3*(n^4 + 1)/2.
 A168180 (program): a(n) = n^3*(n^5 + 1)/2.
 A168181 (program): Characteristic function of numbers that are not multiples of 8.
 A168182 (program): Characteristic function of numbers that are not multiples of 9.
 A168183 (program): Numbers that are not multiples of 9.
 A168184 (program): Characteristic function of numbers that are not multiples of 10.
 A168185 (program): Characteristic function of numbers that are not multiples of 12.
 A168186 (program): Positive numbers that are not multiples of 12.
 A168187 (program): a(n) = n^3*(n^6 + 1)/2.
 A168188 (program): a(n) = n^3*(n^7 + 1)/2.
 A168189 (program): a(n) = n^3*(n^8 + 1)/2.
 A168190 (program): a(n) = n^3*(n^9 + 1)/2.
 A168191 (program): a(n) = n^3*(n^10 + 1)/2.
 A168192 (program): a(n) = n^4*(n^2 + 1)/2.
 A168193 (program): a(n) = a(n1) + a(n2) + 4, with a(0)=0, a(1)=2.
 A168194 (program): a(n) = n^4*(n^3 + 1)/2.
 A168195 (program): a(n) = 2*n  a(n1) + 1 with n>1, a(1)=5.
 A168196 (program): a(n) = n^4*(n^5 + 1)/2.
 A168197 (program): a(n) = 3*n  a(n1) + 1 with n > 1, a(1)=0.
 A168198 (program): a(n) = 3*n  a(n1) + 1 with n > 1, a(1)=1.
 A168199 (program): a(n) = 3*n  a(n1) + 1 with n > 1, a(1)=2.
 A168200 (program): a(n) = 3*n  a(n1) + 1, with a(1)=4.
 A168201 (program): Number of representations of n in the form 7k+11m (with nonnegative k, m).
 A168202 (program): a(n) = 3*n  a(n1) + 1 with n > 1, a(1)=5.
 A168203 (program): a(n) = 4*n  a(n1) + 1 with n>1, a(1)=0.
 A168204 (program): a(n) = 4*n  a(n1) + 1 with n>1, a(1)=1.
 A168205 (program): a(n) = 4*n  a(n1) + 1 with n>1, a(1)=2.
 A168206 (program): a(n) = 5*n  a(n1) + 1 with n>1, a(1)=0.
 A168207 (program): a(n) = 5*n  a(n1) + 1 with n>1, a(1)=2.
 A168209 (program): a(n) = 5*n  a(n1) + 1 with n>1, a(1)=3.
 A168210 (program): a(n) = 6*n  a(n1) + 1 with n>1, a(1)=0.
 A168211 (program): a(n) = (9 + 14n + 23(1)^n)/4.
 A168212 (program): a(n) = 7*n  a(n1) + 1 with n>1, a(1)=4.
 A168213 (program): a(n) = (11 + 18n + 9(1)^n)/4.
 A168220 (program): a(n) = n^4*(n^6 + 1)/2.
 A168224 (program): Where record values occur in A168223.
 A168225 (program): a(n) = n^4*(n^7 + 1)/2.
 A168227 (program): a(n) = n^4*(n^8 + 1)/2.
 A168230 (program): a(n) = n + 2  a(n1) for n>1; a(1) = 0.
 A168232 (program): a(n) = (2n  3(1)^n  1)/2.
 A168233 (program): a(n) = 3*n  a(n1)  1 for n>0, a(1)=1.
 A168235 (program): 1+5n+7n^2.
 A168236 (program): a(n) = (6n  3(1)^n  1)/4.
 A168237 (program): a(n) = (6n + 3(1)^n  3)/4.
 A168240 (program): 1+7n+13n^2.
 A168244 (program): a(n) = 1 + 3n  2n^2.
 A168251 (program): a(n) = n^2 if n is odd, n^2*2^(n2) if n is even.
 A168255 (program): n appears nth nonprime number times.
 A168256 (program): Triangle read by rows: Catalan number C(n) repeated n+1 times.
 A168265 (program): a(n) = A003557(A060735(n)).
 A168269 (program): a(n) = 2*n  (1)^n.
 A168273 (program): a(n) = 2*n + (1)^n  1.
 A168276 (program): a(n) = 2*n  (1)^n  1.
 A168277 (program): a(n) = 2*n  (1)^n  2.
 A168278 (program): (10n + 5(1)^n + 3)/4.
 A168280 (program): (1  5(1)^n + 10n)/4.
 A168281 (program): Triangle T(n,m) = 2*(min(n+m1,m))^2 read by rows.
 A168282 (program): (10n + 5(1)^n  1)/4.
 A168283 (program): a(n) = (10n  5(1)^n  3)/4.
 A168284 (program): a(n) = (10n + 5(1)^n  5)/4.
 A168286 (program): a(n) = (6n + 3(1)^n + 1)/2.
 A168297 (program): a(n) = n^3 + (1n)^2.
 A168298 (program): a(n) = 1  n^2*2^n.
 A168299 (program): a(n) = 1 + 3^n * n^3.
 A168300 (program): a(n) = 6*n  a(n1)  2 with a(1)=5.
 A168301 (program): a(n) = (6n + 3(1)^n  1)/2.
 A168309 (program): Period 2: repeat 4,3.
 A168313 (program): Triangle read by rows, retain 1’s as rightmost diagonal of A101688 and replace all other 1’s with 2’s.
 A168321 (program): a(n) = n +6  a(n1), with a(1) = 0.
 A168326 (program): a(n) = (6n  3(1)^n  1)/2.
 A168328 (program): a(n) = 6 * floor( n/2 ).
 A168329 (program): a(n) = (3/2)(2n  (1)^n  1).
 A168330 (program): Period 2: repeat 3, 2.
 A168331 (program): a(n) = (5 + 14n + 7(1)^n)/4.
 A168332 (program): a(n) = 6 + 7 * floor((n1)/2).
 A168333 (program): a(n) = (14n + 7(1)^n + 1)/4.
 A168336 (program): a(n) = 5 + 7*floor((n1)/2).
 A168337 (program): a(n) = 1 + 7*floor(n/2).
 A168345 (program): a(n) = n^4*(n^9 + 1)/2.
 A168346 (program): a(n) = n^4*(n^10 + 1)/2.
 A168351 (program): a(n) = n^5*(n+1)/2.
 A168361 (program): Period 2: repeat 2, 1.
 A168364 (program): a(n) = n^5*(n^2 + 1)/2.
 A168371 (program): a(n) = n^5*(n^3 + 1)/2.
 A168372 (program): a(n) = n^5*(n^4 + 1)/2.
 A168373 (program): a(n) = 7*n  a(n1)  6 with n>1, a(1)=4.
 A168374 (program): a(n) = 7 * floor(n/2).
 A168376 (program): a(n) = (14n  7(1)^n  9)/4.
 A168378 (program): a(n) = 3 + 8*floor(n/2).
 A168379 (program): a(n) = 4n  2(1)^n + 1.
 A168380 (program): Row sums of A168281.
 A168381 (program): a(n) = 4n + 2(1)^n.
 A168384 (program): a(n) = 4n  2(1)^n.
 A168386 (program): Arithmetic derivative of the double factorial of n.
 A168388 (program): First number in the nth row of A172002.
 A168390 (program): a(n) = 1 + 8*floor(n/2).
 A168392 (program): a(n) = 5 + 8*floor((n1)/2).
 A168397 (program): a(n) = 8 * floor(n/2).
 A168398 (program): a(n) = 4 + 8*floor((n1)/2).
 A168399 (program): a(n) = 3^n mod 13.
 A168400 (program): 3^n mod 15.
 A168401 (program): 4 + 9*floor(n/2).
 A168409 (program): a(n) = 8 + 9*floor((n1)/2).
 A168410 (program): a(n) = 3 + 9*floor(n/2).
 A168411 (program): a(n) = 7 + 9*floor((n1)/2).
 A168412 (program): a(n) = n^5*(n^6 + 1)/2.
 A168413 (program): a(n) = 9*n  a(n1)  5, with a(1)=2.
 A168414 (program): a(n) = (18n  9(1)^n  3)/4.
 A168415 (program): a(n) = 2^n + 7.
 A168416 (program): a(n) = 1 + 9*floor(n/2).
 A168418 (program): a(n) = 9*n  a(n1)  8 with n>1, a(1)=5.
 A168419 (program): a(n) = 9*floor(n/2).
 A168420 (program): a(n) = 4 + 10*floor(n/2).
 A168427 (program): 3^n mod 30.
 A168428 (program): a(n) = 4^n mod 10.
 A168429 (program): a(n) = 4^n mod 11.
 A168430 (program): a(n) = 4^n mod 13.
 A168432 (program): a(n) = n^5*(n^7 + 1)/2.
 A168437 (program): a(n) = 3 + 10*floor(n/2).
 A168455 (program): 3^n+n mod 7.
 A168456 (program): a(n) = (10n  5(1)^n + 1)/2.
 A168457 (program): a(n) = (10n + 5(1)^n  1)/2.
 A168458 (program): a(n) = 7 + 10*floor((n1)/2).
 A168459 (program): a(n) = (10n + 5(1)^n  3)/2.
 A168460 (program): a(n) = 6 + 10*floor((n1)/2).
 A168461 (program): a(n) = 10*floor(n/2).
 A168462 (program): a(n) = n^5*(n^8 + 1)/2.
 A168463 (program): a(n) = 5 + 11*floor(n/2).
 A168465 (program): Numbers that are congruent to 2 or 7 mod 11.
 A168471 (program): a(n) = n^5*(n^9 + 1)/2.
 A168484 (program): Numbers that are congruent to 2, 3, 5, 7 mod 11.
 A168486 (program): Numbers that are congruent to 2, 5 mod 11.
 A168489 (program): Numbers that are congruent to 7,11 mod 12.
 A168491 (program): a(n) = (1)^n*Catalan(n).
 A168493 (program): a(n) = 3^floor(n^2/2).
 A168495 (program): a(n) = 3^floor(n^2/3).
 A168507 (program): a(n) = n^5*(n^10 + 1)/2.
 A168512 (program): Sum of divisors of n weighted by divisor multiplicity in n.
 A168520 (program): a(n) = 98*a(n1)  a(n2); a(1) = 0, a(2) = 10.
 A168526 (program): a(n) = n^6*(n + 1)/2.
 A168527 (program): a(n) = n^6*(n^2 + 1)/2.
 A168538 (program): a(n) = (n+6)(n+1)(n^2 + 7*n + 16)/4.
 A168539 (program): Terms of A123239 which are prime in Z(i), Z(rho) and Z(sqrt(2)).
 A168547 (program): a(n) = 1  2n^2 + 4n(1 + 2n^2)/3.
 A168553 (program): a(n) = 1 if it is possible to place n sets of n queens on an n X n chessboard with no two queens of the same set attacking each other.
 A168555 (program): a(n) = n^6*(n^3 + 1)/2.
 A168559 (program): a(n) = n^2 + a(n1), with a(1)=0.
 A168564 (program): a(n) = n^6*(n^4 + 1)/2.
 A168565 (program): Let p = prime(n); then a(n) = p + (p1)/2.
 A168566 (program): a(n) = (n1)(n+2)(n^2 + n + 2)/4.
 A168569 (program): a(n) = 9*(3^n  1)/2.
 A168570 (program): Exponent of 3 in 2^n  1.
 A168571 (program): a(n) = 25*(5^n  1)/4.
 A168572 (program): a(n) = Sum_ k=2..n (7^k).
 A168574 (program): a(n) = (4n + 3)(1 + 2*n^2)/3.
 A168575 (program): a(n) = (10^n + 1)^3.
 A168579 (program): G.f.: 1/(1x16*x^2).
 A168580 (program): a(n) = (nth prime > 3) minus 3*n.
 A168582 (program): a(n) = (4n^3  6n^2 + 8n + 9 + 3(1)^n)/12.
 A168583 (program): The number of ways of partitioning the multiset 1,1,2,3,…,n1 into exactly three nonempty parts.
 A168587 (program): Smallest digit sum of an ndigit prime with only digits 0 add 1 (or 0, if no such prime exists).
 A168589 (program): a(n) = (2  3^n)*(1)^n.
 A168596 (program): a(n) = 2*a(n1)  1 with a(0)=14.
 A168604 (program): a(n) = 2^(n2)  1.
 A168605 (program): Number of ways of partitioning the multiset 1,1,1,2,3,…,n2 into exactly three nonempty parts.
 A168607 (program): a(n) = 3^n + 2.
 A168608 (program): Decimal expansion of average of twodigit primes.
 A168609 (program): a(n) = 3^n + 4.
 A168610 (program): a(n) = 3^n + 5.
 A168611 (program): a(n) = 3^n  4.
 A168613 (program): a(n) = 3^n  5.
 A168614 (program): a(n) = 2^n + 5.
 A168616 (program): a(n) = 2^n  5.
 A168617 (program): a(n) = 72^(n1)  2n  5.
 A168620 (program): Table T(n,k) with the coefficient [x^k] of the polynomial 5(x+1)^n  4(x^n+1) in column 0<=k<=n. T(0,0)=1.
 A168622 (program): Triangle T(n,k) with the coefficient [x^k] of the polynomial 7(x+1)^n  6(x^n+1) in row n, column k. T(0,0)=1.
 A168624 (program): a(n) = 1  10^n + 100^n.
 A168625 (program): Triangle T(n,k) = 8*binomial(n,k)  7 with columns 0 <= k <= n.
 A168627 (program): a(n) = n^6*(n^5 + 1)/2.
 A168631 (program): a(n) = n^6*(n^7 + 1)/2.
 A168632 (program): a(n) = n^6*(n^8 + 1)/2.
 A168633 (program): a(n) = n^6*(n^9 + 1)/2.
 A168634 (program): a(n) = n^6*(n^10 + 1)/2.
 A168635 (program): a(n) = n^7*(n + 1)/2.
 A168636 (program): a(n) = n^7*(n^2 + 1)/2.
 A168642 (program): a(n) = (8*2^n + (1)^n)/3 for n > 0; a(0) = 1.
 A168648 (program): a(n) = (102^n + 2(1)^n)/3 for n > 0; a(0) = 1.
 A168652 (program): Integers that can be generated with a C/C++ expression that is three or more characters shorter than their decimal representation.
 A168658 (program): a(n) = ceiling(n^n/2).
 A168660 (program): a(n) = n^7*(n^3 + 1)/2.
 A168661 (program): a(n) = n^7*(n^4 + 1)/2.
 A168662 (program): a(n) = n^7*(n^5 + 1)/2.
 A168663 (program): a(n) = n^7*(n^6 + 1)/2.
 A168664 (program): a(n) = n^7*(n^7 + 1)/2.
 A168665 (program): a(n) = n^7*(n^8 + 1)/2.
 A168666 (program): a(n) = n^7*(n^9 + 1)/2.
 A168667 (program): a(n) = n^7*(n^10 + 1)/2.
 A168668 (program): a(n) = n(2 + 5n).
 A168670 (program): Numbers that are congruent to 1, 8 mod 11.
 A168671 (program): Numbers that are congruent to 1, 10 mod 13.
 A168672 (program): Numbers that are congruent to 2,13 mod 17.
 A168674 (program): a(n) = 2*A001610(n).
 A168675 (program): a(n) = n^8*(n + 1)/2.
 A168677 (program): Lexicographically earliest positive integer sequence such that no sum of consecutive terms is a positive power of 4.
 A168834 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168835 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168836 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168837 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168838 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168839 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168840 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168841 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168842 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168843 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168844 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168845 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168846 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168847 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168848 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168849 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168850 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168851 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168852 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168853 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168854 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168855 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168856 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168857 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168858 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168859 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168860 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168861 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168862 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168863 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168864 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168865 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168866 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168867 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168868 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168869 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168870 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168871 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^20 = I.
 A168876 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168877 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168878 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168879 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168880 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168882 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168883 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168884 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168885 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168886 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168887 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168888 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168889 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168890 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168891 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168892 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168893 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168894 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168895 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168896 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168897 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168898 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168899 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168900 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168901 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168902 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168903 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168904 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168905 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168906 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168907 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168908 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168909 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168910 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168911 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168912 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168913 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168914 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168915 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168916 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168917 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168918 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168919 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^21 = I.
 A168923 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168924 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168925 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168926 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168927 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168928 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168929 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168930 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168931 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168932 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168933 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168934 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168935 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168936 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168937 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168938 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168939 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168940 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168941 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168942 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168943 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168944 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168945 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168946 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168947 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168948 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168949 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168950 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168951 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168952 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168953 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168954 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168955 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168956 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168957 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168958 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168959 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168960 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168961 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168962 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168963 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168964 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168965 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168966 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168967 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
 A168971 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168972 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168973 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168974 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168975 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168976 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168977 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168978 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168979 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168980 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168981 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168982 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168983 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168984 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168985 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168986 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168987 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168988 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168989 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168990 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168991 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168992 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168993 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168994 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168995 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168996 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168997 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168998 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A168999 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169000 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169001 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169002 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169003 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169004 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169005 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169006 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169007 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169008 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169009 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169010 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169011 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169012 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169013 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169014 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169015 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^23 = I.
 A169018 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169019 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169021 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169022 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169023 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169024 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169025 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169026 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169027 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169028 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169029 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169030 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169031 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169032 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169033 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169034 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169035 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169036 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169037 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169038 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169039 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169040 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169041 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169042 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169043 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169044 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169045 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169046 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169047 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169048 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169049 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169050 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169051 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169052 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169053 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169054 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169055 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169056 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169057 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169058 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169059 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169060 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169061 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169062 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169063 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^24 = I.
 A169066 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169067 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169068 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169069 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169070 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169071 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169072 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169073 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169074 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169075 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169076 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169077 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169078 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169079 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169080 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169081 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169082 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169083 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169084 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169085 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169086 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169087 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169088 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169089 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169090 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169092 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169093 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169094 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169095 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169096 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169097 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169098 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169099 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169100 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169101 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169102 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169103 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169104 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169105 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169106 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169107 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169108 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169109 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169110 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169111 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^25 = I.
 A169113 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169115 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169116 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169117 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169118 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169119 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169120 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169121 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169122 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169123 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169124 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169125 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169126 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169127 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169128 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169129 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169130 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169131 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169132 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169134 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169135 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169136 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169137 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169138 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169139 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169140 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169141 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169142 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169143 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169144 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169145 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169146 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169147 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169148 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169149 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169150 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169151 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169152 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169153 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169154 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169155 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169156 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169157 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169158 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169159 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^26 = I.
 A169161 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169162 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169163 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169164 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169165 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169166 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169167 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169168 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169169 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169170 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169171 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169172 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169173 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169174 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169175 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169176 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169177 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169178 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169179 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169180 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169181 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169182 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169183 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169184 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169185 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169186 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169187 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169188 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169189 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169190 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169191 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169192 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169193 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169194 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169195 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169196 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169197 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169198 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169199 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169200 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169201 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169202 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169203 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169204 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169205 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169206 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169207 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^27 = I.
 A169209 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169210 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169211 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169212 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169214 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169215 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169216 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169217 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169218 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169219 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169220 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169221 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169222 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169223 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169224 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169225 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169226 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169227 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169228 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169229 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169230 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169231 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169232 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169233 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169234 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169235 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169236 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169237 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169238 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169239 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169240 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169241 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169242 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169243 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169244 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169245 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169246 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169247 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169248 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169249 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169250 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169251 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169252 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169253 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169254 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169255 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^28 = I.
 A169257 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169258 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169259 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169260 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169261 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169262 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169263 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169264 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169265 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169266 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169267 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169268 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169269 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169270 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169271 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169272 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169273 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169274 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169275 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169276 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169277 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169278 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169279 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169280 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169281 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169282 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169283 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169284 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169285 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169286 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169287 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169288 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169289 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169290 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169291 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169292 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169293 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169294 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169295 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169296 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169297 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169298 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169299 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169300 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169301 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169302 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169303 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^29 = I.
 A169305 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169306 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169307 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169308 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169309 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169310 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169311 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169312 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169313 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169314 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169315 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169316 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169317 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169318 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169319 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169320 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169321 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169322 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169323 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169324 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169325 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169326 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169327 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169328 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169329 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169330 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169331 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169332 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169333 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169334 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169335 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169336 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169337 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169338 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169339 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169340 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169341 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169342 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169343 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169344 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169345 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169346 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169347 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169348 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169349 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169350 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169351 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^30 = I.
 A169353 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169354 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169355 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169356 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169358 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169359 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169360 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169361 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169362 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169363 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169364 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169365 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169366 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169367 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169368 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169369 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169370 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169371 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169372 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169373 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169374 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169375 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169376 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169377 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169378 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169379 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169380 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169381 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169382 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169383 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169384 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169385 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169386 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169387 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169388 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169389 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169390 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169391 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169392 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169393 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169394 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169395 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169396 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169397 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169398 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169399 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^31 = I.
 A169406 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169407 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169408 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169409 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169410 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169411 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169412 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169413 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169414 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169415 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169416 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169417 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169418 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169419 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169420 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169421 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169422 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169423 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169424 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169425 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169426 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169427 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169428 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169429 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169430 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169431 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169432 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169433 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169434 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169435 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169436 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169437 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169438 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169439 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169440 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169441 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169442 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169443 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169444 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169445 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169446 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169447 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^32 = I.
 A169448 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169449 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169450 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169451 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169453 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169454 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169455 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169456 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169457 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169458 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169459 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169460 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169461 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169462 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169463 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169464 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169465 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169466 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169467 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169468 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169469 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169470 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169471 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169472 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169473 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169474 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169475 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169476 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169477 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169478 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169479 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169480 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169481 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169482 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169483 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169484 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169485 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169486 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169487 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169488 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169489 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169490 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169491 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169492 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169493 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169494 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169495 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^33 = I.
 A169496 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169497 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169498 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169499 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169500 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169501 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169502 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169503 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169504 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169505 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169506 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169507 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169508 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169509 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169510 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169511 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169512 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169513 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169514 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169515 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169516 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169517 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169518 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169519 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169520 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169521 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169522 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169523 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169524 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169525 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169526 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169527 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169528 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169529 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169530 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169531 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169532 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169533 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169534 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169535 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169536 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169537 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169538 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169539 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169540 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169541 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169542 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169543 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
 A169544 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169545 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169547 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169548 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169549 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169550 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169551 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169552 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169553 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169554 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169555 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169556 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169557 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169558 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169559 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169560 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169561 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169562 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169563 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169564 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169565 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169566 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169567 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169568 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169569 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169570 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169571 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169572 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169573 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169574 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169575 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169576 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169577 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169578 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169579 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A169585 (program): A000004 preceded by 1, 3.
 A169591 (program): Triangle T(n,k) with column n = A059841 if n even and column n = A000007 if n odd.
 A169594 (program): Number of divisors of n, counting divisor multiplicity in n.
 A169597 (program): Numbers that are congruent to 2, 15 mod 19.
 A169598 (program): Numbers that are congruent to 3,18 mod 23.
 A169599 (program): Numbers that are congruent to 4, 23 mod 29.
 A169600 (program): Numbers that are congruent to 4, 25 mod 31.
 A169601 (program): a(n) = (10^n1)^2 + 2.
 A169604 (program): a(n) = 3*6^n.
 A169606 (program): a(2n1) = prime(n+2)3, a(2n) = prime(n+2)2.
 A169607 (program): 7*A000330(n).
 A169609 (program): Period 3: repeat [1, 3, 3].
 A169610 (program): Numbers that are congruent to 5, 30 mod 37.
 A169611 (program): Number of prime divisors of n that are not greater than 3, counted with multiplicity.
 A169622 (program): a(n) = a(n1) + Fibonacci(n), a(1)=5.
 A169630 (program): a(n) = n times the square of Fibonacci(n).
 A169634 (program): a(n) = 3*7^n.
 A169642 (program): a(n) = A005408(n) * A022998(n).
 A169650 (program): a(1) = 3; thereafter a(n) = 3*a(n1)+2^n6.
 A169669 (program): (first digit of n) * (last digit of n) in decimal representation.
 A169675 (program): Lexicographically earliest de Bruijn sequence for n = 3 and k = 2.
 A169676 (program): Lexicographically earliest de Bruijn sequence for n = 2 and k = 3.
 A169687 (program): a(n) = 3^n  3*2^(n2).
 A169695 (program): a(n) = 1 if n is a square, otherwise a(n) = 2.
 A169711 (program): The function W_n(6) (see Borwein et al. reference for definition).
 A169712 (program): The function W_n(8) (see Borwein et al. reference for definition).
 A169713 (program): The function W_n(10) (see Borwein et al. reference for definition).
 A169720 (program): a(n) = (32^(n1)1)(3*2^n1).
 A169721 (program): a(n) = (2(32^(n1)1))^2.
 A169722 (program): a(n) = (32^(n1)1)(18*2^(n1)7).
 A169723 (program): 3^(n1)(23^(n1)+3)+1.
 A169724 (program): (2*3^(n1)+1)^2.
 A169725 (program): 3^(n1)(63^(n1)+5)+1.
 A169726 (program): a(n) = 32^n(2^n1) + 1.
 A169727 (program): a(n) = 3(2^(n+1)2)(2^(n+1)1) + 1.
 A169736 (program): First differences of A169735.
 A169801 (program): a(n) = ((n1)^2n^2(n+1)^2)/6  2Sum_ l=2..n Sum_ k=2..n (nk+1)(nl+1)(k1)(l1).
 A169805 (program): Twice the sum of the digits of n.
 A169810 (program): a(n) = n XOR n^2.
 A169811 (program): a(n) = n XOR n*(n+1)/2.
 A169812 (program): a(n) = n XOR d(n) (cf. A000005).
 A169823 (program): Multiples of 60.
 A169825 (program): Multiples of 420.
 A169827 (program): Multiples of 840.
 A169830 (program): Numbers n such that 2*reverse(n)  n = 1.
 A169831 (program): a(n) = 52^(n+1)  3(n+3).
 A169832 (program): a(n) = 152^(n+1)  (5n^2+22*n+30).
 A169860 (program): Floor of n inches converted to millimeters.
 A169861 (program): Ceiling of n inches converted to millimeters.
 A169865 (program): The sequence T of a pair S, T generalizing Golomb’s sequence A001462 and the pair A093848, A169863. See Comments for definition.
 A169869 (program): Maximum number of rational points on a smooth absolutely irreducible projective curve of genus n over the field F_2.
 A169919 (program): a(n) = n*n in the arithmetic where digits are added in base 10 (as usual) but when digits are to be multiplied they are also added in base 10.
 A169932 (program): a(n) = 0+n in the arithmetic defined in A169918.
 A169933 (program): a(n) = 2+n in the arithmetic defined in A169918.
 A169938 (program): a(n) = n(n+1)(n*(n+1)+1).
 A169958 (program): a(n) = binomial(9*n, n).
 A169959 (program): a(n) = binomial(10*n, n).
 A169960 (program): Binomial(11n,n).
 A169961 (program): a(n) = binomial(12*n, n).
 A169964 (program): Numbers whose decimal expansion contains only 0’s and 5’s.
 A169965 (program): Numbers whose decimal expansion contains only 0’s and 2’s.
 A169966 (program): Numbers whose decimal expansion contains only 0’s and 3’s.
 A169967 (program): Numbers whose decimal expansion contains only 0’s and 4’s.
 A169969 (program): Locations of row maxima in “crushed” version of Stern’s diatomic array.
 A169985 (program): Round phi^n to the nearest integer.
 A169986 (program): Ceiling(phi^n) where phi = (1+sqrt(5))/2.
 A169987 (program): Expansion of Product_ i=0..m1 (1 + x^(2*i+1)) for m=4.
 A169998 (program): a(0)=1, a(1)=1; thereafter a(n) = a(n1)  2*a(n2).
 A170000 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170001 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170002 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170003 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170004 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170005 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170006 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170007 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170008 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170009 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170010 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170011 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^35 = I.
 A170012 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170013 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170014 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170015 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170016 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170017 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170018 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170019 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170020 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170021 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170022 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170023 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170024 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170025 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170026 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170027 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170028 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170029 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170030 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170031 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170032 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170033 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170034 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170035 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170036 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170037 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170038 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170039 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170040 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170041 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170042 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170043 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170044 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170045 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170046 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170047 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170048 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170049 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170050 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170051 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170052 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170053 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170054 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170055 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170056 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170057 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170058 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170059 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^36 = I.
 A170060 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170061 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170062 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170063 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170064 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170065 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170066 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170067 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170068 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170069 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170070 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170071 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170072 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170073 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170074 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170075 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170076 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170077 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170078 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170079 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170080 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170081 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170082 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170083 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170084 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170085 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170086 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170087 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170088 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170089 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170090 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170091 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170092 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170093 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170094 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170095 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170096 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170097 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170098 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170099 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170100 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170101 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170102 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170103 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170104 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170105 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170106 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170107 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^37 = I.
 A170108 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170110 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170111 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170112 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170113 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170114 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170115 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170116 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170117 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170118 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170119 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170120 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170121 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170122 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170123 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170124 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170125 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170126 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170127 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170128 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170129 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170130 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170131 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170132 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170133 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170134 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170135 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170136 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170137 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170138 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170139 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170140 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170141 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170142 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170143 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170144 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170145 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170146 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170147 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170148 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170149 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170150 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170151 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170152 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170153 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170154 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170155 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^38 = I.
 A170156 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170157 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170158 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170159 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170160 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170161 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170162 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170163 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170164 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170165 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170166 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170167 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170168 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170169 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170170 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170171 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170172 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170173 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170174 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170175 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170176 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170177 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170178 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170179 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170180 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170181 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170182 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170183 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170184 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170185 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170186 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170187 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170188 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170189 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170190 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170191 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170192 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170193 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170194 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170195 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170196 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170197 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170198 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170199 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170200 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170201 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170202 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170203 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^39 = I.
 A170204 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170205 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170206 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170207 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170208 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170209 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170210 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170211 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170212 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170213 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170214 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170215 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170216 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170217 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170218 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170219 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170220 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170221 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170222 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170223 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170224 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170225 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170226 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170227 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170228 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170229 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170230 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170231 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170232 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170233 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170234 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170235 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170236 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170237 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170238 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170239 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170240 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170241 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170242 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170243 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170244 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170245 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170246 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170247 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170248 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170249 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170250 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170251 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
 A170252 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170253 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170254 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170255 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170256 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170257 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170258 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170259 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170260 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170261 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170262 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170263 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170264 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170265 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170266 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170267 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170268 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170269 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170270 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170271 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170272 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170273 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170274 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170275 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170276 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170277 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170278 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170279 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170280 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170281 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170282 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170283 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170284 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170285 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170286 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170287 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170288 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170289 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170290 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170291 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170292 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170293 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170294 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170295 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170296 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170297 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170298 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170299 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^41 = I.
 A170300 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170301 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170302 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170303 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170304 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170305 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170306 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170307 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170308 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170309 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170310 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170311 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170312 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170313 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170314 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170315 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170316 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170317 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170318 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170319 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170320 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170321 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170322 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170323 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170324 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170325 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170326 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170327 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170328 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170329 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170330 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170331 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170332 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170333 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170334 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170335 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170336 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170337 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170338 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170339 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170340 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170341 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170342 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170343 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170344 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170345 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170346 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170347 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^42 = I.
 A170348 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170349 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170350 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170351 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170352 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170353 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170354 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170355 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170356 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170357 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170358 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170359 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170360 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170361 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170362 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170363 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170364 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170365 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170366 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170367 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170368 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170369 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170370 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170371 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170372 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170373 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170374 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170375 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170376 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170377 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170378 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170379 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170380 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170381 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170382 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170383 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170384 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170385 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170386 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170387 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170388 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170389 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170390 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170391 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170392 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170393 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170394 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170395 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^43 = I.
 A170396 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170397 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170398 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170399 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170400 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170401 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170402 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170403 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170404 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170405 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170406 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170407 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170408 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170409 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170410 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170411 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170412 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170413 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170414 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170415 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170416 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170417 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170418 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170419 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170420 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170421 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170422 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170423 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170424 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170425 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170426 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170427 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170428 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170429 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170430 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170431 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170432 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170433 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170434 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170435 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170436 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170437 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170438 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170439 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170440 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170441 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170442 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170443 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^44 = I.
 A170444 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170445 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170446 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170447 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170448 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170449 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170450 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170451 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170452 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170453 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170454 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170455 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170456 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170457 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170458 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170459 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170460 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170461 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170462 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170463 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170464 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170465 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170466 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170467 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170468 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170469 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170470 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170471 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170472 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170473 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170474 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170475 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170476 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170477 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170478 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170479 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170480 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170481 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170482 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170483 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170484 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170485 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170486 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170487 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170488 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170489 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170490 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170491 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^45 = I.
 A170492 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170493 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170494 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170495 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170496 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170497 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170498 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170499 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170500 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170501 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170502 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170503 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170504 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170505 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170506 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170507 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170508 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170509 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170510 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170511 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170512 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170513 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170514 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170515 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170516 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170517 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170518 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170519 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170520 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170521 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170522 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170523 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170524 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170525 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170526 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170527 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170528 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170529 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170530 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170531 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170532 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170533 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170534 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170535 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170536 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170537 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170538 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170539 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^46 = I.
 A170540 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170541 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170542 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170543 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170544 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170545 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170546 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170547 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170548 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170549 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170550 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170551 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170552 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170553 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170554 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170555 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170556 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170557 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170558 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170559 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170560 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170561 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170562 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170563 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170564 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170565 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170566 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170567 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170568 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170569 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170570 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170571 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170572 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170573 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170574 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170575 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170576 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170577 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170578 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170579 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170580 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170581 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170582 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170583 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170584 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170585 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170586 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170587 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^47 = I.
 A170588 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170589 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170590 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170591 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170592 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170593 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170594 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170595 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170596 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170597 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170598 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170599 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170600 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170601 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170602 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170603 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170604 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170605 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170606 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170607 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170608 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170609 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170610 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170611 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170612 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170613 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170614 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170615 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170616 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170617 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170618 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170619 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170620 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170621 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170622 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170623 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170624 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170625 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170626 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170627 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170628 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170629 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170630 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170631 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170632 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170633 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170634 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170635 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^48 = I.
 A170636 (program): Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170637 (program): Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170638 (program): Number of reduced words of length n in Coxeter group on 5 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170639 (program): Number of reduced words of length n in Coxeter group on 6 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170640 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170641 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170642 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170643 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170644 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170645 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170646 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170647 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170648 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170649 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170650 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170651 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170652 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170653 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170654 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170655 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170656 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170657 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170658 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170659 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170660 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170661 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170662 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170663 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170664 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170665 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170666 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170667 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170668 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170669 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170670 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170671 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170672 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170673 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170674 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170675 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170676 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170677 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170678 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170679 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170680 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170681 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170682 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170683 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^49 = I.
 A170688 (program): Number of reduced words of length n in Coxeter group on 7 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170689 (program): Number of reduced words of length n in Coxeter group on 8 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170690 (program): Number of reduced words of length n in Coxeter group on 9 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170691 (program): Number of reduced words of length n in Coxeter group on 10 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170692 (program): Number of reduced words of length n in Coxeter group on 11 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170693 (program): Number of reduced words of length n in Coxeter group on 12 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170694 (program): Number of reduced words of length n in Coxeter group on 13 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170695 (program): Number of reduced words of length n in Coxeter group on 14 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170696 (program): Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170697 (program): Number of reduced words of length n in Coxeter group on 16 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170698 (program): Number of reduced words of length n in Coxeter group on 17 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170699 (program): Number of reduced words of length n in Coxeter group on 18 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170700 (program): Number of reduced words of length n in Coxeter group on 19 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170701 (program): Number of reduced words of length n in Coxeter group on 20 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170702 (program): Number of reduced words of length n in Coxeter group on 21 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170703 (program): Number of reduced words of length n in Coxeter group on 22 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170704 (program): Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170705 (program): Number of reduced words of length n in Coxeter group on 24 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170706 (program): Number of reduced words of length n in Coxeter group on 25 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170707 (program): Number of reduced words of length n in Coxeter group on 26 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170708 (program): Number of reduced words of length n in Coxeter group on 27 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170709 (program): Number of reduced words of length n in Coxeter group on 28 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170710 (program): Number of reduced words of length n in Coxeter group on 29 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170711 (program): Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170712 (program): Number of reduced words of length n in Coxeter group on 31 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170713 (program): Number of reduced words of length n in Coxeter group on 32 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170714 (program): Number of reduced words of length n in Coxeter group on 33 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170715 (program): Number of reduced words of length n in Coxeter group on 34 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170716 (program): Number of reduced words of length n in Coxeter group on 35 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170717 (program): Number of reduced words of length n in Coxeter group on 36 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170718 (program): Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170719 (program): Number of reduced words of length n in Coxeter group on 38 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170720 (program): Number of reduced words of length n in Coxeter group on 39 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170721 (program): Number of reduced words of length n in Coxeter group on 40 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170722 (program): Number of reduced words of length n in Coxeter group on 41 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170723 (program): Number of reduced words of length n in Coxeter group on 42 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170724 (program): Number of reduced words of length n in Coxeter group on 43 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170725 (program): Number of reduced words of length n in Coxeter group on 44 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170726 (program): Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170727 (program): Number of reduced words of length n in Coxeter group on 46 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170728 (program): Number of reduced words of length n in Coxeter group on 47 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170729 (program): Number of reduced words of length n in Coxeter group on 48 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170730 (program): Number of reduced words of length n in Coxeter group on 49 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170731 (program): Number of reduced words of length n in Coxeter group on 50 generators S_i with relations (S_i)^2 = (S_i S_j)^50 = I.
 A170732 (program): Expansion of g.f.: (1+x)/(1  12*x).
 A170733 (program): Expansion of g.f.: (1+x)/(113*x).
 A170734 (program): Expansion of g.f.: (1+x)/(114*x).
 A170735 (program): Expansion of g.f.: (1+x)/(115*x).
 A170736 (program): Expansion of g.f.: (1+x)/(116*x).
 A170737 (program): Expansion of g.f.: (1+x)/(117*x).
 A170738 (program): Expansion of g.f.: (1+x)/(118*x).
 A170739 (program): Expansion of g.f.: (1+x)/(119*x).
 A170740 (program): Expansion of g.f.: (1+x)/(120*x).
 A170741 (program): Expansion of g.f.: (1+x)/(121*x).
 A170742 (program): Expansion of g.f.: (1+x)/(122*x).
 A170743 (program): Expansion of g.f.: (1+x)/(123*x).
 A170744 (program): Expansion of g.f.: (1+x)/(124*x).
 A170745 (program): Expansion of g.f.: (1+x)/(125*x).
 A170746 (program): Expansion of g.f.: (1+x)/(126*x).
 A170747 (program): Expansion of g.f.: (1+x)/(127*x).
 A170748 (program): Expansion of g.f.: (1+x)/(128*x).
 A170749 (program): Expansion of g.f.: (1+x)/(129*x).
 A170750 (program): Expansion of g.f.: (1+x)/(130*x).
 A170751 (program): Expansion of g.f.: (1+x)/(131*x).
 A170752 (program): Expansion of g.f.: (1+x)/(132*x).
 A170753 (program): Expansion of g.f.: (1+x)/(133*x).
 A170754 (program): Expansion of g.f.: (1+x)/(134*x).
 A170755 (program): Expansion of g.f.: (1+x)/(135*x).
 A170756 (program): Expansion of g.f.: (1+x)/(136*x).
 A170757 (program): Expansion of g.f.: (1+x)/(137*x).
 A170758 (program): Expansion of g.f.: (1+x)/(138*x).
 A170759 (program): Expansion of g.f.: (1+x)/(139*x).
 A170760 (program): Expansion of g.f.: (1+x)/(140*x).
 A170761 (program): Expansion of g.f.: (1+x)/(141*x).
 A170762 (program): Expansion of g.f.: (1+x)/(142*x).
 A170763 (program): Expansion of g.f.: (1+x)/(143*x).
 A170764 (program): Expansion of g.f.: (1+x)/(144*x).
 A170765 (program): Expansion of g.f.: (1+x)/(145*x).
 A170766 (program): Expansion of g.f.: (1+x)/(146*x).
 A170767 (program): Expansion of g.f.: (1+x)/(147*x).
 A170768 (program): Expansion of g.f.: (1+x)/(148*x).
 A170769 (program): Expansion of g.f.: (1+x)/(149*x).
 A170774 (program): a(n) = n^8*(n^2+1)/2.
 A170775 (program): a(n) = n^8*(n^3 + 1)/2.
 A170776 (program): a(n) = n^8*(n^4 + 1)/2.
 A170777 (program): a(n) = n^8*(n^5 + 1)/2.
 A170778 (program): a(n) = n^8*(n^6 + 1)/2.
 A170779 (program): a(n) = n^8*(n^7 + 1)/2.
 A170780 (program): a(n) = n^8*(n^8 + 1)/2.
 A170781 (program): a(n) = n^8*(n^9 + 1)/2.
 A170782 (program): a(n) = n^8*(n^10 + 1)/2.
 A170783 (program): a(n) = n^9*(n + 1)/2.
 A170784 (program): a(n) = n^9*(n^2 + 1)/2.
 A170785 (program): a(n) = n^9*(n^3 + 1)/2.
 A170786 (program): a(n) = n^9*(n^4 + 1)/2.
 A170787 (program): a(n) = n^9*(n^5 + 1)/2.
 A170788 (program): a(n) = n^9*(n^6 + 1)/2.
 A170789 (program): a(n) = n^9*(n^7 + 1)/2.
 A170790 (program): a(n) = n^9*(n^8 + 1)/2.
 A170791 (program): a(n) = n^9*(n^9 + 1)/2.
 A170792 (program): a(n) = n^9*(n^10 + 1)/2.
 A170793 (program): a(n) = n^10*(n + 1)/2.
 A170794 (program): a(n) = n^10*(n^2 + 1)/2.
 A170795 (program): a(n) = n^10*(n^3 + 1)/2.
 A170796 (program): a(n) = n^10*(n^4 + 1)/2.
 A170797 (program): a(n) = n^10*(n^5+1)/2.
 A170798 (program): a(n) = n^10*(n^6 + 1)/2.
 A170799 (program): a(n) = n^10*(n^7 + 1)/2.
 A170800 (program): a(n) = n^10*(n^8 + 1)/2.
 A170801 (program): a(n) = n^10*(n^9 + 1)/2.
 A170802 (program): a(n) = n^10*(n^10 + 1)/2.
 A170818 (program): a(n) is the product of primes (with multiplicity) of form 4*k+1 that divide n.
 A170819 (program): a(n) = product of distinct primes of the form 4k1 that divide n.
 A170825 (program): a(n) is the product of the distinct primes of form 6*k1 that divide n.
 A170826 (program): a(n) = gcd(n^2, n!).
 A170836 (program): First differences of A170837.
 A170837 (program): a(0)=0, a(1)=1 and a(n) = 16n27 for n >= 2.
 A170881 (program): a(0)=0; thereafter a(n) = (3n+1)2^(n2)+1.
 A170930 (program): G(n,1) with n index G(n,i)=n(G(n,i1)+G(n,i2))=(a^ib^i)d where d=sqrt(n*(n+4)); a=(n+d)/2; b=(nd)/2
 A170931 (program): Extended Lucas L(n,i) = n(L(n,i1) + L(n,i2)) = a^i + b^i where d = sqrt(n(n+4)); a=(n+d)/2; b=(nd)/2.
 A170932 (program): a(n) = binomial(n + 8, 8)*7^n .
 A170933 (program): a(n) = A000930(n) + A000930(n+3) + 4.
 A170934 (program): a(n) = b(n) + b(n+1) + 2, where b() = A000930().
 A170938 (program): 4^n+2^n+2.
 A170939 (program): 4^n2^n+2.
 A170940 (program): 4^n2^n2.
 A170955 (program): a(n) = 10^n  9.
 A170956 (program): Expansion of Product_ i=1..m (1 + x^(4*i1)) for m = 3.
 A170966 (program): Expansion of Product_ i=0..m1 (1 + x^(4*i+1)) for m = 3.
 A171001 (program): Binomial(nk,k)^2 where k = ceiling(n/4).
 A171005 (program): (n+1)*(n1)!/2.
 A171070 (program): A bisection of A178482.
 A171071 (program): A bisection of A178482.
 A171074 (program): A115112 with initial term changed from 0 to 1.
 A171088 (program): To find 3 consecutive integers in the sequence, you have to take 4 consecutive terms, no more and no less.
 A171089 (program): a(n) = 2*(Lucas(n)^2  (1)^n)).
 A171129 (program): a(n)=(n^4n^3n^2n)/2.
 A171140 (program): Numbers n such that 6*n+7=p^2 (p=prime).
 A171141 (program): Numbers that are congruent to 6,33 mod 41.
 A171148 (program): 3+10^n+3*100^n.
 A171152 (program): Partial sums of A118011.
 A171157 (program): Number of distinct primes > 3 that divide n.
 A171160 (program): a(n) = a(n1) + 2a(n2) with a(0)=3, a(1)=4.
 A171182 (program): Period 6: repeat [0, 1, 1, 1, 0, 2].
 A171216 (program): (4^(5*n+1) + 7)/11.
 A171218 (program): a(n) = sum(A109613(k)*A005843(nk): 0<=k<=n).
 A171220 (program): a(n) = (2n + 1)*5^n.
 A171226 (program): 9+10^n+9*100^n.
 A171228 (program): n^(pn) where p is smallest prime > n.
 A171230 (program): a(n) = 0+1+2+…+n in lunar arithmetic in base 2 written in base 2.
 A171231 (program): a(n) = (10*2^n + 3  (1)^n)/6.
 A171237 (program): a(0)=2, a(1)=3, a(n) = 3 + a(n1) + a(n2) for n >= 2.
 A171248 (program): a(n) = 10^n(2+310^n)+3.
 A171270 (program): a(n) is the only number m such that m = pi(1^(1/n)) + pi(2^(1/n)) + … + pi(m^(1/n)).
 A171272 (program): a(n) = 1 + 4n(1 + 2*n^2)/3.
 A171369 (program): Triangle read by rows, replace 2’s with 3’s in A169695.
 A171372 (program): a(n) = Numerator of 1/(2n)^2  1/(3n)^2 for n > 0, a(0) = 1.
 A171375 (program): 1+3*10^n+100^n.
 A171378 (program): a(n) = (n+1)^2  A006046(n+1).
 A171379 (program): Triangle, read by rows, T(n, k) = A059481(n,k)*(A059481(n,k)  1)/2.
 A171382 (program): a(n) = (22^n+7(1)^n)/3.
 A171386 (program): The characteristic function of 2 and 3: 1 if n is prime such that either n1 or n+1 is prime, else 0.
 A171387 (program): The characteristic function of primes > 3: 1 if n is prime such that neither prime+1 is prime else 0.
 A171389 (program): a(n) = 21*2^n  1.
 A171390 (program): a(n) = 37*2^(n1)1.
 A171405 (program): Sum of divisors of n, excluding divisors 2 and 3.
 A171410 (program): 1+5*10^n+100^n.
 A171417 (program): Decimal expansion of (5+sqrt(65))/4.
 A171418 (program): Expansion of (1+x)^4/(1x).
 A171424 (program): (n1)^(pn+1)+n where p is the smallest prime > n1.
 A171435 (program): Product of odd prime factors < n, with multiplicity.
 A171438 (program): a(n) = 0+1+2+…+n in lunar arithmetic in base 3 written in base 10.
 A171440 (program): Expansion of (1+x)^5/(1x).
 A171441 (program): Expansion of (1+x)^6/(1x).
 A171442 (program): Expansion of (1+x)^7/(1x).
 A171443 (program): Expansion of (1+x)^8/(1x).
 A171445 (program): Sequence whose G.f is given by f(z)=(1+z)^(24)/(1z).
 A171449 (program): Powers of 2 (A000079) with 1 changed to 1.
 A171451 (program): a(n) = 2^C(n, 2) * 2^floor(n/3).
 A171452 (program): a(n) = C(n,2) + floor(n/3).
 A171461 (program): a(n) = 1 + 6*10^n + 100^n.
 A171462 (program): Number of hands a bartender needs to have in order to win at the blind bartender’s problem with n glasses in a cycle.
 A171463 (program): The natural numbers excluding 2 and 3.
 A171472 (program): a(n) = 6a(n1)  8a(n2) for n > 1; a(0) = 7, a(1) = 30.
 A171473 (program): a(n) = 6a(n1)  8a(n2)3 for n > 1; a(0) = 35, a(1) = 135.
 A171475 (program): a(n) = 6a(n1)8a(n2) for n > 2; a(0) = 1, a(1) = 6, a(2) = 27.
 A171476 (program): a(n) = 6a(n1)  8a(n2) for n > 1, a(0)=1, a(1)=6.
 A171477 (program): a(n) = 6a(n1)  8a(n2) + 1 for n > 1; a(0) = 1, a(1) = 7.
 A171478 (program): a(n) = 6a(n1)  8a(n2) + 2 for n > 1; a(0) = 1, a(1) = 8.
 A171479 (program): a(n) = 6a(n1)8a(n2)+3 for n > 1; a(0) = 1, a(1) = 8.
 A171480 (program): a(n) = 6a(n1)  8a(n2) + 4 for n > 1; a(0) = 1, a(1) = 9.
 A171494 (program): a(n) = 2*a(n1) for n > 1; a(0) = 6, a(1) = 16.
 A171495 (program): a(n) = 3*a(n1)+4 for n > 0; a(0) = 6.
 A171496 (program): a(n) = 6a(n1)  8a(n2) for n > 1; a(0) = 6, a(1) = 28.
 A171497 (program): a(n) = 2*a(n1) for n > 1; a(0) = 3, a(1) = 8.
 A171498 (program): 4*3^n1.
 A171499 (program): a(n) = 6a(n1)  8a(n2) for n > 1; a(0) = 3, a(1) = 14.
 A171501 (program): Inverse binomial transform of A084640.
 A171503 (program): Number of 2 X 2 integer matrices with entries from 0,1,…,n having determinant 1.
 A171504 (program): a(n) = nth nonprime + n.
 A171507 (program): a(n) = (52^(n+1)9(1)^n)/62n.
 A171508 (program): Numbers that are not the sum of the kth noncomposite number and k for any k >= 1.
 A171511 (program): Numbers that are not the sum of the kth composite number and k for any k >= 1.
 A171512 (program): a(n) = numbers m such that are not the sum of kth nonprime number and k for any k >= 1.
 A171513 (program): 1+8*10^n+100^n.
 A171516 (program): a(n) = a(n1) + a(n2) + k, n>1; with a(0) = 1, a(1) = 2, k = 3.
 A171519 (program): a(n) = numbers m such that are not the product of kth noncomposite number and k for any k >= 1.
 A171522 (program): Denominator of 1/n^21/(n+2)^2.
 A171523 (program): a(n) = n*(nth nonprime number).
 A171524 (program): a(n) = numbers m such that are not the product of kth nonprime number and k for any k >= 1.
 A171525 (program): Numerator of (nth noncomposite/n).
 A171526 (program): Denominator of (nth noncomposite/n).
 A171553 (program): 1+9*10^n+100^n.
 A171555 (program): Numbers of the form prime(n)*(prime(n)1)/4.
 A171556 (program): a(n)=3*C(n)2, where C(n)=A000108(n).
 A171559 (program): Powers of 2 (cf. A000079) with 1 replaced by 3.
 A171575 (program): nth noncomposite number plus nth even nonprime number.
 A171577 (program): 0, 1 and primes > 3.
 A171581 (program): The natural numbers without primes > 3.
 A171583 (program): 10^n(4+310^n)+3.
 A171587 (program): Sequence of the diagonal variant of the Fibonacci word fractal. Sequence of the Fibonacci tile.
 A171588 (program): The Pell word: Fixed point of the morphism 0>001, 1>0.
 A171590 (program): 1+4^(n+1)4*(2)^n.
 A171609 (program): Lim_ n>inf. (A171608)^n, = leftshifted vector considered as a sequence.
 A171613 (program): a(n) = n^2 + sum of the digits of n^2.
 A171621 (program): Numerator of 1/4  1/n^2, each fourth term multiplied by 4.
 A171622 (program): Floor(nth noncomposite / n).
 A171623 (program): Floor(nth composite / n).
 A171624 (program): Floor(nth nonprime / n).
 A171626 (program): Ceiling(nth noncomposite/n).
 A171627 (program): Ceiling(nth composite/n).
 A171630 (program): 10^n(5+310^n)+3
 A171638 (program): Denominator of 1/(n2)^2  1/(n+2)^2.
 A171640 (program): a(n) = 10*a(n1)a(n2)4 with a(1)=1 and a(2)=3.
 A171647 (program): a(1) = 1; for n > 1, a(n) = 2a(n1) if n is even, a(n) = ((n+1)/(n1))a(n1) if n is odd.
 A171654 (program): Period 10: repeat 0, 1, 6, 7, 2, 3, 8, 9, 4, 5.
 A171656 (program): 10^n(7+310^n)+3.
 A171662 (program): a(n) = floor((2*n^2 + n)/6).
 A171663 (program): Expansion of (1 + 4x  6x^2  16x^3 + 20x^4)/((1x)(12x)(1+2x)(12x^2)).
 A171677 (program): Period 9:repeat 7,5,7,4,2,4,1,8,1.
 A171712 (program): Triangle T(n,k) read by rows. Coloring of sectors in a circle.
 A171714 (program): a(n) = ceiling((n+1)^4/2).
 A171718 (program): 10^n(8+310^n)+3.
 A171722 (program): a(n) = 0+1+2+…+n in lunar arithmetic in base 9 written in base 10.
 A171723 (program): a(n) = 0+1+2+…+n in lunar arithmetic in base 9 written in base 9.
 A171736 (program): 10^n(2+710^n)+7.
 A171739 (program): a(n) = 2^(n(n1)/2)3^(n*(n+1)/2).
 A171743 (program): a(n) = A000010(A001043(n)).
 A171747 (program): Smallest prime > nth prime of the form 3*k1.
 A171751 (program): Maximum k with 1 <= k <= n such that nk + 1 is prime (or 0 if no such prime exists).
 A171757 (program): Even numbers whose binary expansion begins 10.
 A171758 (program): Binary expansion of numbers in A171757.
 A171763 (program): Odd numbers whose binary expansion begins 10.
 A171764 (program): Binary expansion of numbers in A171763.
 A171766 (program): 10^n(3+710^n)+7.
 A171769 (program): Partial sums of A042964 (numbers congruent to 2 or 3 mod 4).
 A171774 (program): Radix expansion of 1/6 in radix exp(Pi/sqrt(3)).
 A171781 (program): Numbers for which the second bit of the binary expansion is equal to the last bit.
 A171782 (program): Binary expansion of numbers in A171781.
 A171783 (program): Third smallest divisor of smallest number having exactly n divisors.
 A171784 (program): Fourth smallest divisor of smallest number having exactly n divisors.
 A171790 (program): G.f. A(x) satisfies: A(x*(1+x)^3) = 1 + x.
 A171799 (program): O.g.f.: Sum_ n>=0 2^(n^2)x^n/(1  2^nx)^n.
 A171820 (program): Numbers n such that the nth prime is of the form 3k + 1/2 + 1/2.
 A171834 (program): Partial sums of numbers congruent to 0, 1, 2, 7 mod 8 (A047527).
 A171835 (program): Partial sums of numbers congruent to 3, 4, 5, 6 mod 8 (A047425).
 A171842 (program): Binomial transform of 1,0,1,0,2,0,4,0,8,0,16,…
 A171861 (program): Expansion of x(1+x+x^2) / ( (x1)(x^3+x^21) ).
 A171869 (program): a(n) is the period of A175555(n) in the sequence A175555 .
 A171891 (program): 1 and all numbers >= 10.
 A171892 (program): 0, 1 and all numbers >= 9.
 A171893 (program): 1, 2 and all numbers >= 10.
 A171900 (program): Backwards van Eck transform of A010060.

A171905 (program): a(1) = 1 and a(2) = 2, a(n) = (sum of previous terms)  n .  A171950 (program): a(1)=1. a(n) = the absolute difference between (the sum of previous terms) and A000217(n2), n>1.
 A171960 (program): Values of the 2complement of n in ternary representation.
 A171965 (program): Partial sums of floor(n^2/6) (A056827).
 A171970 (program): Integer part of the height of an equilateral triangle with side length n.
 A171971 (program): Integer part of the area of an equilateral triangle with side length n.
 A171972 (program): Greatest integer k such that k/n^2 < sqrt(3).
 A171974 (program): Integer part of the height of a regular tetrahedron with edge length n.
 A171975 (program): Integer part of the circumsphere radius of a regular tetrahedron with edge length n.
 A171977 (program): a(n) = 2^(k+1) where 2^k is the highest power of 2 dividing n.
 A171982 (program): Beatty sequence for sqrt(11).
 A171983 (program): Beatty sequence for sqrt(13).
 A171984 (program): Beatty sequence for sqrt(17).
 A172011 (program): 12*A002605(n).
 A172022 (program): a(n) = prime(n) + (1)^n.
 A172043 (program): 5n^2  n + 1.
 A172044 (program): 5n^2+11n+1.
 A172045 (program): a(n) = (9n^4+10n^33n^24n)/12.
 A172046 (program): Partial sums of floor(n^2/7) (A056834).
 A172047 (program): n(n+1)(15*n^2n8)/12.
 A172050 (program): A008585+A029907.
 A172051 (program): Decimal expansion of 1/999999.
 A172073 (program): a(n) = (4n^3 + n^2  3n)/2.
 A172075 (program): a(n) = n(n+1)(9*n^2  n  5)/6.
 A172076 (program): a(n) = n(n+1)(14*n11)/6.
 A172077 (program): a(n) = n(n+1)(7*n^2  n  4)/4.
 A172078 (program): a(n) = n(16n^2 + 3*n  13)/6.
 A172080 (program): a(n) = n(12n^3 + 10n^2  9n  7)/6.
 A172082 (program): a(n) = n(n+1)(6*n5)/2.
 A172085 (program): a(n) = n(27n^3 + 22n^2  21n  16)/12.
 A172097 (program): Table T(n,k) read by rows which contains in row n the 2^n terms of A171968 starting at the (n+1)st 3.
 A172100 (program): Diagonal of the 26 X 26 Caesar Shift table.
 A172103 (program): Partial sums of A167020 where A167020(n)=1 iff 6*n1 is prime.
 A172104 (program): Partial sums of A167021 where A167021(n)=1 iff 6*n+1 is prime.
 A172113 (program): Partial sums of the generalized Cuban primes A007645.
 A172117 (program): a(n) = n(n+1)(20*n17)/6.
 A172118 (program): n(n+1)(5*n^2n3)/2.
 A172123 (program): Number of ways to place 2 nonattacking bishops on an n X n board.
 A172128 (program): Floor((r^n)/n), where r = golden ratio = (1+sqrt(5))/2.
 A172131 (program): Partial sums of floor(n^2/9) (A056838).
 A172132 (program): Number of ways to place 2 nonattacking knights on an n X n board.
 A172137 (program): Number of ways to place 2 nonattacking zebras on an n X n board
 A172160 (program): a(0)=1. a(n)= 2^n*(5n)/4, n>0.
 A172165 (program): A simple sequence a(n) = n + n^(n1).
 A172170 (program): 1 followed by the duplicated entries of A090368.
 A172172 (program): Sums of NWSE diagonals of triangle A172171.
 A172173 (program): Sums of NESW diagonals of triangle A172171.
 A172174 (program): a(n) = a(n1)*90 + 1.
 A172175 (program): a(n) = a(n1)*110 + 1.
 A172178 (program): 99n+1.
 A172188 (program): Partial sums of primes of the form 3*k1.
 A172190 (program): a(n) = 2*prime(n)^3.
 A172191 (program): a(n) = 2*prime(n)^4.
 A172193 (program): 5n^2+31n+1.
 A172200 (program): Number of ways to place 2 nonattacking amazons (superqueens) on an n X n board
 A172225 (program): Number of ways to place 2 nonattacking wazirs on an n X n board.
 A172229 (program): Number of ways to place 3 nonattacking wazirs on a 3 X n board.
 A172241 (program): a(n) = (1/18)*(8^n  (1)^n  9).
 A172242 (program): Number of 10D hypercubes in an ndimensional hypercube.
 A172252 (program): a(n) = 4*2^n  9.
 A172284 (program): First positive zeros of Bessel function of order n rounded to nearest integer
 A172285 (program): a(n) = (52^n  5(1)^n  3n(1)^n) / 9.
 A172286 (program): Numbers of circuits of length 2n in K_ n,n (the complete bipartite graph on 2n vertices).
 A172362 (program): a(n) = binomial(n+10, 10)*3^n.
 A172367 (program): Numbers n > 0 such that n+4 is a prime.
 A172407 (program): Positive numbers n such that n+10 is a prime.
 A172416 (program): a(n) = 52^n/9 + 1/4 + (1)^n(n/6 + 7/36).
 A172417 (program): n*Catalan number(n) triangle.
 A172423 (program): Period length 10: repeat 0,9,2,7,4,5,6,3,8,1.
 A172430 (program): Period length 10: repeat 2,1,6,7,0,3,4,9,8,5 .
 A172447 (program): a(n) = (1 + 52^(2n + 1)  3*n)/9.
 A172471 (program): a(n) = floor(sqrt(2*n)).
 A172472 (program): a(n) = floor(sqrt(2*n^3)).
 A172473 (program): a(n) = floor(sqrt(2*n^5)).
 A172474 (program): a(n) = floor(n*sqrt(2)/4).
 A172475 (program): a(n) = floor(n*sqrt(3)/2).
 A172476 (program): a(n) = floor(n/sqrt(6)).
 A172481 (program): a(n) = (3n2^n+2^(n+4)+2*(1)^n)/18.
 A172482 (program): a(n) = (1+n)(9 + 11n + 4*n^2)/3.
 A172486 (program): Number of prime knots up to nine crossings with determinant 2n+1 and signature 6.
 A172492 (program): a(n)=(n!)^2*(n+1)!, n=0,1… .
 A172501 (program): a(n) = binomial(n+8,8)*6^n.
 A172510 (program): a(n) = binomial(n + 4, 4) * 8^n.
 A172511 (program): a(n) = a(n1) * (11a(n1)  a(n2)) / (a(n1) + 4a(n2)), with a(0) = a(1) = 1.
 A172513 (program): Complement of A167389.
 A172517 (program): Number of ways to place 2 nonattacking queens on an n X n toroidal board.
 A172525 (program): 9n12345679.
 A172968 (program): a(n) = 7*a(n1)  a(n2) for n>1, a(0)=1, a(1)=2.
 A172978 (program): a(n) = binomial(n+10, 10)*4^n.
 A173000 (program): a(n) = binomial(n + 4, 4)*9^n.
 A173009 (program): Expansion of o.g.f. x(1  x + x^2)/(1 3x +x^2 +3x^3 2x^4).
 A173010 (program): a(n) = round((2^n  n  1)/4).
 A173012 (program): a(1) = 1, for n >= 2; a(n) = the smallest number h such that sigma(h) = A000203(h) = a(n1) + 2, a(n) = 0 if no such number exists.
 A173013 (program): a(1) = 1, for n >= 2; a(n) = the smallest number h such that sigma(h) = A000203(h) = a(n1) + 3, a(n) = 0 if no such number exists.
 A173014 (program): a(1) = 1, for n >= 2; a(n) = the smallest number h such that sigma(h) = A000203(h) = a(n1) + 4, a(n) = 0 if no such number exists.
 A173033 (program): Second diagonal under the main diagonal in A172119 written in a square (see comment).
 A173034 (program): Sequence whose G.f is f such that: f(z)=8/(12*z)12/(1z)+z+5.
 A173035 (program): Cat years in human years: a(0) = 0, a(1) = 15, a(2) = 24, a(n) = a(n1) + 4 for n >= 3.
 A173036 (program): a(n) = binomial(n+1, 2) + 13.
 A173039 (program): Odd numerators of the fractions (1/41/n^2), n>= 2.
 A173041 (program): a(n) = 2*10^n + 3.
 A173044 (program): Product plus sum of five consecutive nonnegative numbers.
 A173059 (program): Nonnegative numbers n such that 2*n + 17 is prime.
 A173064 (program): a(n) = prime(n)  5.
 A173067 (program): a(n) = A130665(n1)  A160715(n).
 A173072 (program): nth prime minus nth even number.
 A173073 (program): (nth nonnegative nonprime) minus (n1).
 A173078 (program): a(n) = (52^n  2(1)^n  9)/3.
 A173089 (program): a(n) = 25*n^2 + n.
 A173102 (program): Number of partitions x + y = z with x,y,z in 1,2,3,..,3n and z > y >= x.
 A173113 (program): a(n) = binomial(n + 10, 10) * 5^n.
 A173114 (program): a(0)=a(1)=1, a(n) = 2*a(n1) A010686(n), n>1.
 A173115 (program): a(n) = (sin(2narccos(sqrt(3))))^2.
 A173116 (program): a(n) = sinh(2arcsinh(n))^2 = 4n^2*(n^2 + 1).
 A173121 (program): a(n) = sinh(2arccosh(n))^2 = 4n^2*(n^2  1).
 A173123 (program): a(n) = binomial(n+9,9)*6^n.
 A173124 (program): a(n) = binomial(n+10,10)*6^n.
 A173135 (program): Primes other than 3 and 5.
 A173137 (program): nth nonnegative noncomposite number plus n.
 A173141 (program): a(n) = 49*n^2 + n.
 A173151 (program): a(n) = a(n1)  [a(n1)/2] + a(n2)  [a(n5)/2] where [k] = floor(k).
 A173154 (program): a(n) = n^3/6 + 3n^2/4 + 7n/3 + 7/8 + (1)^n/8.
 A173155 (program): a(n) = binomial(n + 5, 5) * 8^n.
 A173173 (program): a(n) = ceiling(Fibonacci(n)/2).
 A173177 (program): Numbers k such that 2k+3 is a prime of the form 3*A034936(m) + 4.
 A173184 (program): Partial sums of A000166.
 A173187 (program): a(n) = binomial(n + 3, 3)*9^n.
 A173188 (program): a(n) = binomial(n + 5, 5)*9^n.
 A173191 (program): a(n) = binomial(n + 6, 6)*9^n.
 A173192 (program): a(n) = binomial(n + 7, 7)*9^n.
 A173193 (program): (2*10^n+43)/9.
 A173196 (program): Partial sums of A002620.
 A173197 (program): a(0)=1, a(n)= 2+2^n/6+4*(1)^n/3, n>0.
 A173200 (program): Solutions y of the Mordell equation y^2 = x^3  3a^2  1 for a = 0,1,2, … (solutions x are given by A053755).
 A173202 (program): Solutions y of the Mordell equation y^2 = x^3  3a^2 + 1 for a = 0,1,2, … (solutions x are given by the sequence A000466)
 A173205 (program): a(n) = 98*a(n1)a(n2) for n>2, a(1)=1, a(2)=98.
 A173209 (program): Partial sums of A000069.
 A173227 (program): Partial sums of A000262.
 A173234 (program): Expansion of x(1+3x^22x^3+2x^4x^5)/((1+x)(x1)^2(x^2+1)^2).
 A173235 (program): a(n) = n^(n1) + n  1.
 A173237 (program): Alternate n and 10n for each n.
 A173249 (program): Partial sums of A000272.
 A173254 (program): a(n) = a(n1) + a(n2)  [a(n2)/2]  [a(n4)/2].
 A173259 (program): Period 3: repeat [4, 1, 4].
 A173261 (program): Array T(n,k) read by antidiagonals: T(n,2k)=1, T(n,2k+1)=n, n>=2, k>=0.
 A173262 (program): a(n) = (2*10^n+61)/9
 A173263 (program): Successive numbers n such that ChebyshevT[n/2, n] is not an integer.
 A173267 (program): a(n) = 121*n^2 + n.
 A173275 (program): a(n) = 169*n^2 + n.
 A173276 (program): a(n) = a(n2) + a(n3)  floor(a(n3)/2)  floor(a(n4)/2).
 A173294 (program): Values of 16n^2+24n+7, n>=0, each duplicated.
 A173300 (program): Denominators of fractions that answer the question “If x + y = 1 and x^2 + y^2 = 2, then x^n + y^n =”
 A173307 (program): a(n) = 13n(n+1).
 A173308 (program): 17n(n+1).
 A173309 (program): 19n(n+1).
 A173314 (program): a(n) = 6*n!+1.
 A173316 (program): 6*n!  1.
 A173317 (program): 5*n!  1.
 A173318 (program): Partial sums of A005811.
 A173319 (program): 5*n! + 1.
 A173321 (program): a(n) = 4*n!  1.
 A173322 (program): 4*n! + 1.
 A173323 (program): 3*n!  1.
 A173324 (program): 3*n! + 1.
 A173345 (program): Number of trailing zeros of the superfactorial of n (A000178).
 A173388 (program): a(n) = a(n  3) + a(n  4) if n is even, else a(n  2) + a(n  3).
 A173391 (program): a(n) = 6n + 3^n.
 A173432 (program): NWSE diagonal sums of Riordan array A112468.
 A173433 (program): a(n) = (A000045(n)+A173432(n))/2.
 A173434 (program): a(n) = (A000045(n)A173432(n))/2.
 A173455 (program): Row sums of triangle A027751.
 A173468 (program): Sum n^k, k=0..n+1.
 A173474 (program): Numbers n such that n*2^n + 1 is not prime.
 A173495 (program): a(n) = Lucas(n)  floor(Lucas(n)/2).
 A173497 (program): a(n) = a(n1) + a(n2)  floor(a(n2)/2), starting 2,1.
 A173499 (program): Number of sequences of length n with terms from 0,1,…,n1 such that the sum of terms is 0 modulo n and the ith term is not i.
 A173508 (program): a(n) = ceiling(A173497(n)/2).
 A173510 (program): a(n) = a(n1) + a(n2)  floor( a(n1)/2 ).
 A173511 (program): a(n) = 4*n^2 + floor(n/2).
 A173512 (program): a(n) = 8*n + 4 + n mod 2.
 A173513 (program): a(n) = ceiling(A173510(n)/2).
 A173516 (program): a(1)=1, a(n)= 3na(n1)+1, n>1
 A173517 (program): a(n) = k if n is the kth nonsquare, zero otherwise.
 A173521 (program): a(n) is the concatenation of n 1’s, 0, n 1’s and 0.
 A173522 (program): Zero together with the partial sums of A105321.
 A173523 (program): 1+A053735(n1), where A053735 is the sumofdigits function in base 3.
 A173524 (program): a(n) = A053737(4^k+n1) in the limit k>infinity, where k plays the role of a row index in A053737.
 A173525 (program): a(n) = 1 + A053824(n1), where A053824 = sum of digits in base 5.
 A173526 (program): a(n) = 1 + A053827(n1), where A053827 is the sumofdigits function in base 6.
 A173527 (program): a(n) = 1 + A053828(n1), where A053828 is the sum of digits in base 7.
 A173528 (program): a(n) = 1 + sum of digits of n1 written in base 8.
 A173529 (program): a(n) = 1 + A053830(n1), where A053830 is the sum of the digits of its argument in base 9.
 A173530 (program): Number of ON cells after n generations of threedimensional cellular automaton related to Sierpinski’s triangle and the toothpick sequences (See Comments for definition)
 A173531 (program): a(0)=0: For n>0, a(n) = A060632(n)*A060632(n1).
 A173535 (program): a(n) = (1/11) * (5*12^n + 6).
 A173536 (program): A173039(n) + A173259(n).
 A173537 (program): a(n) = A173522(n)/2.
 A173541 (program): Triangle read by rows: T(n,k)=k if k is a proper nondivisor of n, otherwise T(n,k)=0 (1<=k<=n).
 A173557 (program): a(n) = Product_ primes p dividing n (p1).
 A173562 (program): a(n) = n^2 + floor(n/4).
 A173598 (program): Period 6: repeat [1, 8, 7, 2, 4, 5].
 A173601 (program): Greatest inverse of A071542, i.e., a(n) = maximal i such that A071542(i) = n.
 A173633 (program): a(n) = a(n2) + a(n3)  [a(n3)/4]  [a(n4)/2]  [a(n5)/4].
 A173635 (program): Period 5 sequence: 1, 1, 4, 4, 2, …
 A173636 (program): Number of positive solutions of equation x(x+n)=y*y.
 A173645 (program): Partial sums of floor(n^2/11).
 A173653 (program): Partial sums of floor(n^2/10) (A056865)
 A173657 (program): 2+2^n+3^n.
 A173661 (program): Logarithmic derivative of the squares of the Fibonacci numbers (A007598, with offset).
 A173673 (program): a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.
 A173674 (program): a(n) = ceiling(A003269(n)/2).
 A173690 (program): Partial sums of round(n^2/5).
 A173691 (program): Partial sums of round(n^2/6).
 A173692 (program): a(n) = ceiling(A000931(n)/2).
 A173704 (program): Partial sums of floor(n^3/2).
 A173707 (program): Partial sums of floor(n^3/3).
 A173711 (program): Nonnegative integers, six even followed by two odd.
 A173712 (program): Numbers n such that (n+n+1) divides the decimal concatenation [n, n+1].
 A173714 (program): Floor(Lucas(n+1)/2), Lucas(n) = A000032(n).
 A173721 (program): Partial sums of A056833.
 A173722 (program): Partial sums of round(n^2/8).
 A173731 (program): a(n) = a(n1) * (11a(n1)  a(n2)) / (a(n1) + 4a(n2)), a(0) = a(1) = 0, a(2) = 1.
 A173732 (program): a(n) = (A016957(n)/2^A007814(A016957(n))  1)/2, with A016957(n) = 6*n+4 and A007814(n) the 2adic valuation of n.
 A173734 (program): (10^n+62)/9 for n>0.
 A173735 (program): a(n) = (10^n + 26)/9.
 A173736 (program): (10^n+35)/9 for n>0.
 A173737 (program): (10^n+44)/9 for n>0.
 A173740 (program): Triangle T(n,k) = binomial(n,k) + 2 for 1 <= k <= n  1, n >= 2, and T(n,0) = T(n,n) = 1 for n >= 0, read by rows.
 A173741 (program): T(n,k) = binomial(n,k) + 4 for 1 <= k <= n  1, n >= 2, and T(n,0) = T(n,n) = 1 for n >= 0, triangle read by rows.
 A173742 (program): Triangle T(n,k) = binomial(n,k) + 6 with T(n,0) = T(n,n) = 1 for n >= 0, read by rows.
 A173764 (program): (3*10^n+51)/9 for n>0.
 A173766 (program): (10^n+11)/3.
 A173768 (program): a(n) = (4*10^n31)/9.
 A173770 (program): a(n)=(4*10^n13)/9.
 A173772 (program): (4*10^n + 23)/9.
 A173773 (program): a(3n) = 8n+2, a(3n+1) = 2n+1, a(3n+2) = 8n+6.
 A173776 (program): a(n) = (4*10^n + 41)/9.
 A173777 (program): Infinite sequence gradually builds a triangle plus another more widely spaced triangle on top of it, or overlapping, if you will.
 A173785 (program): Expansion of 2(1 4x +14x^2 +4x^3 +9*x^4)/(1x)^5.
 A173786 (program): Triangle read by rows: T(n,k) = 2^n + 2^k, 0 <= k <= n.
 A173787 (program): Triangle read by rows: T(n,k) = 2^n  2^k, 0 <= k <= n.
 A173796 (program): Partial sums of A051489.
 A173802 (program): a(n)=(5*10^n23)/9.
 A173804 (program): a(n) = (5*10^n  41)/9 for n > 0.
 A173805 (program): a(n) = (6*10^n51)/9 for n>0.
 A173806 (program): a(n) = (7*10^n61)/9 for n>0.
 A173807 (program): (7*10^n43)/9 for n>0.
 A173808 (program): (7*10^n+11)/9 for n>0.
 A173809 (program): a(2n+1) = 1+A131941(2n+1). a(2n) = A131941(2n).
 A173810 (program): (8*10^n71)/9 for n>0.
 A173811 (program): (8*10^n53)/9 for n>0.
 A173812 (program): (8*10^n17)/9 for n>0.
 A173813 (program): 2*(10^n5), n>0.
 A173833 (program): 10^n  3.
 A173834 (program): a(n)=10^n2*n
 A173835 (program): 10^n+2*n.
 A173855 (program): a(n) = A173039(n+4)  A173039(n+1).
 A173856 (program): Expansion of 10/9 in base phi.
 A173857 (program): Expansion of 3/2 in base phi.
 A173858 (program): Expansion of 4/3 in base phi.
 A173861 (program): Expansion of 8/7 in base phi.
 A173862 (program): a(n) = A158772(n1)/21.
 A173864 (program): Expansion of 9/8 in base phi.
 A173873 (program): a(n) = 2*a(n1) + 13, a(1)=1.
 A173905 (program): 2,3 and the nonprimes A141468.
 A173919 (program): Numbers that are prime or one less than a prime.
 A173922 (program): In the sequence of nonnegative integers substitute all n by 2^floor(n/4) occurrences of (n mod 2).
 A173923 (program): In the sequence of nonnegative integers substitute all n by 2^floor(n/8) occurrences of (n mod 2).
 A173950 (program): a(n) = 1 if 6 divides (prime(n) + 1), a(n) = 1 if 6 divides (prime(n)  1), a(n) = 0 otherwise.
 A173952 (program): a(1)=32 and, for n > 1, a(n) = 9*a(n1) + 32.
 A173960 (program): Averages of four consecutive odd squares.
 A173961 (program): Averages of two consecutive even cubes: (n^3+(n+2)^3)/2.
 A173962 (program): Averages of two consecutive odd cubes; a(n) = (n^3+(n+2)^3)/2.
 A173963 (program): Number of nonoverlapping placements of one 1 X 1 square and one 2 X 2 square on an n X n board.
 A173965 (program): Averages of four consecutive cubes.
 A173989 (program): a(n) is the 2adic valuation of A173300(n).
 A174002 (program): a(n) = n*binomial(n+4, 4).
 A174007 (program): a(2n+1)=2. a(2n)= 1n.
 A174008 (program): nth prime plus nth even nonnegative nonprime.
 A174012 (program): a(n) = 3 * A064680(n).
 A174028 (program): Triangle T(n,k) = 2+4k read by rows.
 A174029 (program): a(n) = 3(3n+1)*(5  (1)^n)/4.
 A174032 (program): Triangle T(n, k) = Sum_ j>=0 floor(binomial(n, k)/2^j), read by rows.
 A174038 (program): Triangle T(n, k, q) = Sum_ j>=0 q^j * floor(binomial(n, k)/2^j) with q = 3, read by rows.
 A174041 (program): Composites of the form 6n+2 or 6n+3.
 A174048 (program): Prime(A173919(n))
 A174060 (program): Sum_ k=1..n floor(sqrt(k))^2 .
 A174088 (program): Number of pairs (i,j) such that i*j == 0 (mod k), 0 <= i <= j < k.
 A174090 (program): Powers of 2 and odd primes; alternatively, numbers that cannot be written as a sum of at least three consecutive positive integers.
 A174091 (program): a(n) = n OR 2.
 A174114 (program): Even central polygonal numbers (A193868) divided by 2.
 A174120 (program): Partial sums of A024012.
 A174121 (program): Partial sums of A001580.
 A174132 (program): 2*3^(n1)(1)^n.
 A174138 (program): Numbers congruent to 5,6,7,8,9,15,16,17,18,19 mod 25.
 A174139 (program): Numbers congruent to 0,1,2,3,4,10,11,12,13,14,20,21,22,23,24 mod 25.
 A174140 (program): Numbers congruent to k mod 25, where 10 <= k <= 24.
 A174141 (program): Numbers congruent to k mod 25, where 0 <= k <= 9.
 A174183 (program): a(n) is the period k such that binomial(m, n) (mod 10) = binomial(m + k, n) (mod 10).
 A174191 (program): Expansion of (1+x)(2x1)/((1x)(x^2+2x1)).
 A174192 (program): Expansion of (1x+2x^2)/ ((1x)*(12xx^2)).
 A174239 (program): a(n) = (3n + 1 + (1)^n(n+3))/4.
 A174256 (program): Number of 3 X 3 reduced magic squares with distinct values and maximum value 2n; also, with magic sum 3n.
 A174257 (program): Number of symmetry classes of 3 X 3 reduced magic squares with distinct values and maximum value 2n; also, with magic sum 3n.
 A174273 (program): Inverse Moebius transform of A035263.
 A174275 (program): a(n) = 2^n mod M(n) where M(n) = A014963(n) is the exponential of the Mangoldt function.
 A174282 (program): a(n) = 3^n mod M(n) where M(n) = A014963(n) is the exponential of the Mangoldt function.
 A174296 (program): Row sums of A174294.
 A174312 (program): 32*n.
 A174316 (program): Sequence defined by a(0)=a(1)=a(2)=1, a(3)=2, a(4)=6 and the formula a(n)=2^(n2)+2 for n>=5.
 A174317 (program): a(0)=1, a(1)=2, a(2)=1; for n>2, a(n) = 7*2^(n3)2.
 A174318 (program): a(n) = ceiling(n!/e) with e = A001113 = exp(1).
 A174325 (program): Trisection A061037(3*n2) of the Balmer spectrum numerators extended to negative indices.
 A174333 (program): 61*n^2.
 A174334 (program): 73*n^2.
 A174335 (program): Upper bound in enumerating what majority decisions are possible with possible abstaining.
 A174337 (program): 94*n^2.
 A174338 (program): a(n) = 97*n^2.
 A174339 (program): a(n) = 109*n^2.
 A174371 (program): a(n) = (6*n1)^2.
 A174373 (program): Triangle T(n,m) = nextprime(binomial(n,m)) read by rows.
 A174374 (program): Derivative Pascal’s triangle (version 2) read by rows: smallest prime(n)>C(m,k)=binomial(m,k)=m!/(k!*(mk)!), 0<=k<=m.
 A174375 (program): a(n) = n^2  XOR(n^2, n).
 A174390 (program): a(2n) = n, a(2n+1) = 2n+4.
 A174395 (program): The number of different 4colorings for the vertices of all triangulated planar polygons on a base with n vertices if the colors of two adjacent boundary vertices are fixed.
 A174396 (program): Numbers congruent to 1,4,5,8 mod 9.
 A174398 (program): Numbers that are congruent to 1, 4, 5, 8 mod 12.

A174405 (program): Partial sums of Sum_ k=1..n n/gcd(n,k), or partial sums of Sum_ d n d*phi(d) (see A057660).  A174424 (program): Number of “noniterative” n x n adjacency matrices of sphere packings in R^3.
 A174426 (program): Denominator of fractions in A171676.
 A174438 (program): Numbers that are congruent to 0, 2, 5, 8 mod 9.
 A174446 (program): Triangle T(n, k, q) = ceiling(binomial(n, k)/f(n, q)) with T(0, 0) = 1, f(n, q) = 1 + tanh((n1)/q), and q = 1, read by rows.
 A174452 (program): a(n) = n^2 mod 1000.
 A174474 (program): a(n) = (2n^2  2n  3)/8 + 3(1)^n(12*n)/8.
 A174491 (program): Denominator in the coefficient of x^n in exp( Sum_ m>=1 x^m/(m*2^(m^2)) ).
 A174542 (program): Partial sums of odd Fibonacci numbers (A014437).
 A174549 (program): a(n) = (2n1)! + (2n)!.
 A174565 (program): Expansion of (1+3x)/((1x)(1+3x+4x^2)).
 A174571 (program): a(4n)=n, a(4n+1)=4, a(4n+2)=1, a(4n+3)=4.
 A174574 (program): Partial sums of A065363.
 A174592 (program): Numbers n such that n^2 + 2*(n+2)^2 is a square.
 A174595 (program): a(n) = 5n^2/8  n + 1/2 + (1)^n(3*n^2/8 + n  1/2).
 A174605 (program): Partial sums of A011371.
 A174623 (program): (2^p+1)^2 where p is prime.
 A174634 (program): a(n) = 3^n*F(n+2).
 A174642 (program): Number of ways to place 4 nonattacking amazons (superqueens) on a 4 X n board.
 A174655 (program): Partial sums of A049486.
 A174666 (program): a(n) = 2 * a(n2) * a(n1) with a(1)=1 and a(2)=3.
 A174677 (program): a(n) = 2a(n1)a(n2) with a(0)=1 and a(1)=1.
 A174686 (program): Number of equivalence classes of 3 X 3 matrices filled with n colors so that no two rotations are identical.
 A174687 (program): Central coefficients T(2n,n) of the Catalan triangle A033184.
 A174695 (program): Partial sums of A173950.
 A174709 (program): Partial sums of floor(n/6).
 A174711 (program): Composites of the form 2*n^n + 1 = A216147(n).
 A174723 (program): a(n) = n(4n^2  3*n + 5)/6.
 A174724 (program): Sum_ k=1..n Floor((k + 3*sqrt(k))/k).
 A174737 (program): a(n) = a(n1)  a(n2), with a(0)=2, a(1)=1.
 A174738 (program): Partial sums of floor(n/7).
 A174744 (program): (2^p1)^2 where p is prime.
 A174745 (program): yvalues in the solution to x^2  21*y^2 = 1.
 A174779 (program): yvalues in the solution to x^2  42*y^2 = 1.
 A174783 (program): Expansion of (1+2xsqrt(14x^2))/(2(1x^2)*sqrt(14x^2)).
 A174784 (program): Expansion of x*(1x+x^3+x^4)/(1+x^6) (Period 12).
 A174785 (program): Expansion of (1+2xx^2+x^3x^4x^5)/(1+x^3)^2.
 A174794 (program): a(0) = 0 and a(n) = (4n^3  12n^2 + 20*n  9)/3 for n >= 1.
 A174799 (program): Partial sums of A051034.
 A174803 (program): a(n) = n + ceiling(sqrt(n))*floor(sqrt(n)).
 A174804 (program): a(n) = nceiling(sqrt(n))floor(sqrt(n)).
 A174806 (program): a(n)=nfloor(sqrt(n))^2floor(sqrt(nfloor(sqrt(n))^2))^2; Difference between n and sum of two largest distinct squares <= n.
 A174814 (program): a(n) = n(n+1)(5*n+1)/3.
 A174828 (program): An averaging sum sequence based on:a(n,m)=Floor[(a(n  1, m  1) + a(n  1, m))/2] with limit q
 A174836 (program): a(n) = 1 + ((6n1)2^n + (1)^n)/3.
 A174841 (program): Determinant of the symmetric n X n matrix M_n where M_n(j,k) = n^abs(jk).
 A174850 (program): Quintisection A061037(5*n2).
 A174868 (program): Partial sums of Stern’s diatomic series A002487.
 A174881 (program): Number of admissible graphs of order n.
 A174883 (program): Largest odd divisors of Fibonacci numbers.
 A174889 (program): First column of A174888.
 A174901 (program): a(n) = the smallest numbers k such that A007955(k) >= n, where A007955(m) = product of divisors of m.
 A174902 (program): Denominator of 1  1/n^2, using 0 at the pole where n=0.
 A174910 (program): Partial sums of A028835.
 A174927 (program): Periodic sequence: Repeat 1, 64.
 A174928 (program): Partial sums of A174927.
 A174929 (program): Partial sums of A174928.
 A174931 (program): Half of the digital sum of base 3 representations of 2^n.
 A174934 (program): a(n) = Sum_ k<=n A007955(k) * A000027(nk+1) = Sum_ k<=n A007955(k) * (nk+1), where A007955(m) = product of divisors of m.
 A174935 (program): a(n) = Sum_ k<=n A007955(k) * A000027(k) = Sum_ k<=n A007955(k) * k, where A007955(m) = product of divisors of m.
 A174939 (program): a(n) = Sum_ k<=n A007955(k) * A007955(k) = Sum_ k<=n (A007955(k))^2, where A007955(m) = product of divisors of m.
 A174944 (program): Greatest number k such that sum of the nth powers of the digits of k is greater than k.
 A174962 (program): a(n) = n^n*(3+n)/2.
 A174964 (program): Determinant of the symmetric n X n matrix M_n where M_n(j,k) = n^2+1 for j = k, M_n(j,k) = n for abs(jk) = 1, M_n(j,k) = 0 otherwise.
 A174968 (program): Decimal expansion of (1 + sqrt(2))/2.
 A174971 (program): Periodic sequence: Repeat 3, 3.
 A174989 (program): Partial sums of A003602.
 A174994 (program): Repeat (8*n+4)^2.
 A175001 (program): Number of stable ncelled patterns (“still lifes”) in the Move (aka Morley; B368/S245) cellular automaton.
 A175005 (program): Expansion of x/(1  4x + 3x^2  2*x^3).
 A175006 (program): Row sums of triangle A175009.
 A175028 (program): a(n)=n+1 if n is prime, otherwise a(n)=n1.
 A175029 (program): a(n)=2n if n is prime, otherwise a(n)=3n.
 A175030 (program): a(n)=3n if n is prime, otherwise a(n)=2n.
 A175032 (program): a(n) is the difference between nth triangular number and next perfect square.
 A175036 (program): 2^(n1) mod prime(n).
 A175044 (program): Lengths of runs of consecutive values in A168389(n).
 A175068 (program): a(n) = product of perfect divisors of n.
 A175069 (program): a(n) = product of perfect divisors of n / n.
 A175077 (program): Final number reached by iterating r > A049711(r) starting at r = n.
 A175078 (program): Number of iterations of r mod (max prime p < r) needed to reach 1 or 2 starting at r = n.
 A175109 (program): a(n) = ((2*n+1)^3+(1)^n)/2.
 A175110 (program): a(n) = ((2*n+1)^4+1)/2.
 A175111 (program): ((2*n+1)^5+(1)^n)/2.
 A175112 (program): First differences of A175111.
 A175113 (program): a(n) = ((2*n + 1)^6 + 1)/2.
 A175114 (program): First differences of A175113.
 A175126 (program): a(0) = a(1) = 0, for n >= 2, a(n) = number of steps of iteration of r  (smallest prime divisor of r) needed to reach 0 starting at r = n.
 A175134 (program): Define a(n) as the number of ways to achieve n from the following procedure. Let R= r(k) and S= s(k) each be some permutation of (1,2,3,…,j) for some nonnegative integer j (with R and S being empty sets if j=0). Define (b(0),b(1),…,b(j)) as follows. b(0)=1. b(m) = b(m1)*r(m) + s(m), for 1<= m <= j. Does b(j) = n? If so, add 1 to the count. Calculate the b(j)’s by taking j over all nonnegative integers, and taking R and S over all permutations for a given j. The total count equals a(n).
 A175139 (program): a(1)= 1. a(n) = smallest integer > a(n1) such that the partial sums of A175140 are avoided. Or, the first difference of A131937.
 A175144 (program): a(n) = d(p(n)1) + d(p(n)+1), where p(n) is the nth prime, and where d(m) is the number of divisors of m.
 A175161 (program): a(n) = 8*(2^n + 1).
 A175162 (program): a(n) = 16*(2^n + 1).
 A175163 (program): a(n) = 32*(2^n + 1).
 A175164 (program): a(n) = 16*(2^n  1).
 A175165 (program): a(n) = 32*(2^n  1).
 A175166 (program): a(n) = 64*(2^n  1).
 A175167 (program): a(n) = Sum_ j=1..floor(n/2) binomial(n+j1,j1).
 A175186 (program): a(1)=0. For 1<= n <= 2^m, m>=0, a(n+ 2^m) = a(n)+n.
 A175187 (program): a(n) = A175186(n)+n.
 A175191 (program): a(n) = the smallest positive integer such that (the nth prime)+2*a(n) is composite.
 A175214 (program): a(n)= a(r)+a(s) ; (r+s)<=n ; r=floor(sqrt(n)) ; s=floor(sqrt(n1)).
 A175216 (program): The first nonprimes after the primes.
 A175217 (program): The second nonprimes after the primes.
 A175219 (program): The fourth nonprimes after the primes.
 A175221 (program): a(n) = prime(n) + 4.
 A175222 (program): a(n) = prime(n) + 5.
 A175223 (program): a(n) = prime(n) + 7.
 A175224 (program): a(n) = prime(n) + 8.
 A175225 (program): a(n) = prime(n) + 10.
 A175228 (program): Remaining sequence of step 3 of sieve from A175227.
 A175229 (program): Delete sequence of step 4 of sieve from A175227.
 A175237 (program): 2*(10^n  7).
 A175247 (program): Primes (A000040) with noncomposite (A008578) subscripts.
 A175248 (program): Noncomposites (A008578) with noncomposite (A008578) subscripts.
 A175249 (program): Noncomposites (A008578) with nonprime (A018252) subscripts.
 A175250 (program): Nonprimes (A018252) with noncomposite (A008578) subscripts.
 A175251 (program): Composites (A002808) with nonprime (A018252) subscripts.
 A175254 (program): a(n) = Sum_ k<=n A000203(k)*(nk+1), where A000203(m) is the sum of divisors of m.
 A175287 (program): Partial sums of ceiling(n^2/4).
 A175312 (program): Maximum value on Lower Shuffle Part of Kimberling’s Expulsion Array (A035486).
 A175318 (program): a(n) = Sum_ k<=n A007955(k), where A007955(m) = product of divisors of m.
 A175332 (program): Numbers whose binary expansion is of the form 11+0*
 A175337 (program): Fixed point of morphism 0 > 00110, 1 > 00111
 A175346 (program): a(n) = Sum_ k=1..n^2 d(k), d(k) = number of divisors of k (A000005).
 A175348 (program): Last digit of p^p, where p is the nth prime.
 A175395 (program): a(n) = 2*Fibonacci(n)^2.
 A175406 (program): The greatest integer k such that (1+1/n)^k <= 2.
 A175408 (program): a(n) + a(n  1) is alternatively a cube or a square.
 A175409 (program): Successive numbers of consecutive positive terms to add when rearranging the alternating harmonic series to sum to log[7/3].
 A175410 (program): a(n) = (b(m)1)*b(m) = Sum_ n=b(m)+1,…,c(m) n, b=A046174, c=A046175, m=n+1.
 A175430 (program): a(n) = (n1)! * (n+1)!.
 A175432 (program): a(n) = the greatest number k such that sigma(n) = m^k for any m >= 1 (sigma = A000203).
 A175462 (program): Number of divisors of integers of form 5 + 8n.
 A175485 (program): Numerators of averages of squares of the first n positive integers.
 A175527 (program): Digit sum of 13^n.
 A175540 (program): a(n) = A067076(n) + n.
 A175548 (program): Binary weight of sigma(n).
 A175558 (program): a(n) = 167^n.
 A175567 (program): (n!)^2 modulo n(n+1)/2.
 A175601 (program): 7*(10^n9).
 A175602 (program): 8*(10^n3).
 A175603 (program): 8*(10^n5).
 A175604 (program): a(n) = 8*(10^n7).
 A175605 (program): a(n) = concatenation of n^3 with itself.
 A175608 (program): Characteristic function of squarefree triangular integers: 1 if n(n+1)/2 is squarefree else 0.
 A175614 (program): a(1)=1, a(2)=5, then a(n)=a(n2)+4, if n odd else a(n)=prime(primepi(a(n2)+4)).
 A175629 (program): Legendre symbol (n,7).
 A175630 (program): a(n) = nth pentagonal number mod (n+2).
 A175631 (program): a(n) = (nth pentagonal number) modulo (nth triangular number).
 A175633 (program): Numbers x such that x^2  28*y^2 = 1 for some integer y.
 A175649 (program): a(n) = sopf(n) + sopf(n+1).
 A175656 (program): Eight bishops and one elephant on a 3 X 3 chessboard. G.f.: (13x^2)/(13x+4*x^3).
 A175658 (program): Eight bishops and one elephant on a 3 X 3 chessboard: a(n) = 2Pell(n+1)+2Pell(n)2^n, with Pell = A000129.
 A175660 (program): Eight bishops and one elephant on a 3 X 3 chessboard. a(n) = 2^(n+2)  3*F(n+2).
 A175661 (program): Eight bishops and one elephant on a 3 X 3 chessboard: a(n) = 2^(n+2)3*F(n+1), with F(n) = A000045(n).
 A175672 (program): yvalues in the solution to x^2  28*y^2=1.
 A175673 (program): Number of ndigit terms in A179955.
 A175676 (program): a(n) = binomial(n,3) mod n.
 A175677 (program): Binomial(n,4) mod n.
 A175700 (program): a(n) = n ^ phi(n+1), phi(n) = A000010(n) = Euler totient function.
 A175723 (program): a(1)=a(2)=1; thereafter a(n) = gpf(a(n1)+a(n2)), where gpf = “greatest prime factor”.
 A175724 (program): Partial sums of floor(n^2/12).
 A175753 (program): Numbers with 46 divisors.
 A175774 (program): 7*(10^n5)
 A175775 (program): 7*(10^n3).
 A175776 (program): Partial sums of floor(n^2/15).
 A175777 (program): Partial sums of floor(n^2/16).
 A175780 (program): Partial sums of floor(n^2/24).
 A175784 (program): Numerators of k/(10+k)+1 for k = 2*n1.
 A175787 (program): Primes together with 4.
 A175805 (program): a(n) = 21*2^n.
 A175806 (program): a(n) = 27*2^n.
 A175812 (program): Partial sums of ceiling(n^2/6).
 A175822 (program): Partial sums of ceiling(n^2/7).
 A175824 (program): Maximum unsigned integer that can be stored in n bytes.
 A175825 (program): Maximum signed integer that can be stored in n bytes.
 A175826 (program): Partial sums of ceiling(n^2/8).
 A175827 (program): Partial sums of ceiling(n^2/10).
 A175828 (program): a(n) = (n(6n+1)+(n+2)*(1)^n)/2.
 A175829 (program): Partial sums of ceiling(n^2/11).
 A175831 (program): Partial sums of ceiling(n^2/12).
 A175833 (program): Periodic sequence: repeat 4,7,11.
 A175842 (program): Partial sums of ceiling(n^2/14).
 A175846 (program): Partial sums of ceiling(n^2/15).
 A175848 (program): Partial sums of ceiling(n^2/16).
 A175851 (program): a(n) = 1 for noncomposite n, a(n) = n  previousprime(n) + 1 for composite n.
 A175852 (program): a(n) = the highest power of 5 with n decimal digits.
 A175856 (program): a(n) = n for n = noncomposites, a(n) = previous term  1 for n = composites.
 A175864 (program): Partial sums of ceiling(n^2/19).
 A175868 (program): Partial sums of ceiling(n^2/20).
 A175869 (program): Partial sums of ceiling(n^2/23).
 A175870 (program): Partial sums of ceiling(n^2/24).
 A175880 (program): a(1)=1, a(2)=2. If n >= 3: if n/2 is in the sequence, a(n)=0, otherwise a(n)=n.
 A175884 (program): Numbers that are congruent to 0, 2, 4, 7, 9 mod 12.
 A175885 (program): Numbers that are congruent to 1, 10 mod 11.
 A175886 (program): Numbers that are congruent to 1, 12 mod 13.
 A175887 (program): Numbers that are congruent to 1, 14 mod 15.
 A175919 (program): Convert n to binary. XOR each respective digit of binary n and binary A030101(n), where A030101(n) is the reversal of the order of the digits in the binary representation of n (given in decimal). a(n) is the decimal value of the result.
 A175921 (program): Period 5: repeat [1, 2, 2, 1, 1].
 A175922 (program): Period 5: repeat [1, 1, 2, 1, 2].
 A175925 (program): a(n) = (2n+1)(n+1)!.
 A175944 (program): 1 appears once, nth prime p appears p times.
 A175965 (program): Lexicographically earliest sequence with first differences as increasing sequence of noncomposites A008578.
 A175966 (program): Complement of A175965(n), where A175965(n) = the lexicographically earliest sequence with first differences as increasing sequence of noncomposites A008578.
 A175967 (program): Lexicographically earliest sequence with first differences as increasing sequence of nonprimes A018252.
 A175968 (program): Complement of A175967(n), where A175967(n) = the lexicographically earliest sequence with first differences as increasing sequence of nonprimes A018252(n).
 A175969 (program): Complement of A014284(n), where A014284(n) = the lexicographically earliest sequence with first differences as increasing sequence of primes A000040.
 A175970 (program): Complement of A051349(n), where A051349(n) = the lexicographically earliest sequence with first differences as increasing sequence of composites A002808(n).
 A175971 (program): Denominators of 1/161/m^2 for some m>0, which are of the form (8*k+4)^2, sorted by increasing m.
 A175976 (program): 4^n3*n+1.
 A175991 (program): a(n) = binomial(binomial(binomial(n, 2), 3), 4)/5.
 A176003 (program): a(n) = 3*(nth noncomposite number)  2.
 A176010 (program): Positive numbers k such that k^2 == 2 (mod 97).
 A176014 (program): Decimal expansion of (3+sqrt(21))/6.
 A176027 (program): Binomial transform of A005563.
 A176029 (program): a(n)= n^Omega(n).
 A176032 (program): Absolute values of A106044A056892.
 A176040 (program): Periodic sequence: Repeat 3, 1.
 A176043 (program): a(n) = (2n1)(n1)^(n1).
 A176044 (program): nthprime without last digit.
 A176050 (program): Det(M) where M is an n X n antisymmetric matrix with M(i,j) = n for i < j.
 A176051 (program): Decimal expansion of (2+sqrt(6))/2.
 A176053 (program): Decimal expansion of (3+2*sqrt(3))/3.
 A176055 (program): Decimal expansion of (2+sqrt(5))/2.
 A176059 (program): Periodic sequence: Repeat 3, 2.
 A176060 (program): a(n) = n(n+1)(3n^2+5n+4)/12.
 A176095 (program): a(n) = n  phi(2*n), where phi() is the Euler totient A000010().
 A176100 (program): Even numbers that are not semiprimes, or, twice the nonprimes.
 A176102 (program): Decimal expansion of (3+2*sqrt(3))/2.
 A176105 (program): Decimal expansion of (3+sqrt(11))/2.
 A176126 (program): Numerator of A127276(n)/A001788(n).
 A176128 (program): a(n) = (n*n!)^2.
 A176145 (program): a(n) = n(n3)(n^27*n+14)/8.
 A176174 (program): Starting with 1, multiply the nth term by 10, then subtract the sum of all terms up to and including the nth, to make the (n+1)th term.
 A176177 (program): a(n) = 2n3^(n1)  (3^n1)/2.
 A176203 (program): Triangle read by rows: T(n, k) = 16*binomial(n, k)  15.
 A176213 (program): Decimal expansion of 2+sqrt(6).
 A176214 (program): Decimal expansion of (6+4*sqrt(3))/3.
 A176218 (program): Decimal expansion of (4 + 3*sqrt(2))/2.
 A176222 (program): a(n) = (n^23*n+1+(1)^n)/2.
 A176246 (program): a(n) = A001223(n+1)  1.
 A176260 (program): Periodic sequence: Repeat 5, 1.
 A176270 (program): Triangle T(n,m) = 1 + m*(mn) read by rows, 0 <= m <= n.
 A176271 (program): The odd numbers as a triangle read by rows.
 A176281 (program): Hankel transform of A176280.
 A176337 (program): a(n) = 1 + (12^n)*a(n1) for n > 0, a(0)=0.
 A176338 (program): a(n) = 1 + (13^n)*a(n1) for n >=1, a(0) = 0.
 A176355 (program): Periodic sequence: Repeat 6, 1.
 A176360 (program): a(n) = quadrant of unit circle corresponding to n radians.
 A176393 (program): a(n) = A176100(n) + 1 = 2*A141468(n) + 1.
 A176394 (program): Decimal expansion of 3+2*sqrt(3).
 A176395 (program): Decimal expansion of 3+sqrt(11).
 A176405 (program): Fixed point of morphism 0>0100110, 1>0110110
 A176409 (program): Multiples of 3 or 7.
 A176413 (program): a(n) = 19*3^n.
 A176415 (program): Periodic sequence: repeat 7,1.
 A176439 (program): Decimal expansion of (7+sqrt(53))/2.
 A176447 (program): a(2n) = n, a(2n+1) = 2n+1.
 A176448 (program): 7*2^n2
 A176449 (program): a(n) = 9*2^n  2.
 A176453 (program): Decimal expansion of 4+2*sqrt(5).
 A176458 (program): Decimal expansion of 4+sqrt(17).
 A176476 (program): Partial sums of A012814.
 A176496 (program): a(n) = Sum_ k=1..n 2^nonprime(k).
 A176514 (program): Period 6: repeat [3, 1, 1, 3, 2, 1].
 A176522 (program): Decimal expansion of (9+sqrt(85))/2.
 A176537 (program): Decimal expansion of 5 + sqrt(26).
 A176542 (program): Numbers n such that there are only a finite nonzero number of sets of n consecutive triangular numbers that sum to a square.
 A176563 (program): Period 4: repeat [1, 3, 1, 1].
 A176566 (program): Triangle T(n, k) = binomial(n*(n+1)/2 + k, k), read by rows.
 A176569 (program): a(n) = (1)^n + (nth prime of the form 3k+1).
 A176580 (program): n^3+Largest square, (Largest square <= n^3).
 A176581 (program): n^3+Smallest square, (Smallest square >= n^3).
 A176582 (program): n^2+Largest cube, (Largest cube <= n^2).
 A176583 (program): n^2+Smallest cube, (Smallest cube >= n^2).
 A176592 (program): List of pairs n,11*n
 A176593 (program): List of pairs n,13*n.
 A176597 (program): Double primes: concatenation of the nth prime with itself.
 A176624 (program): a(n) = prime(n) + n*(1)^n.
 A176625 (program): T(n,k) = 1 + 3k(k  n), triangle read by rows (n >= 0, 0 <= k <= n).
 A176627 (program): Triangle T(n, k) = 12^(k*(nk)), read by rows.
 A176628 (program): a(n) = prime(n)  n*(1)^prime(n).
 A176631 (program): Triangle T(n, k) = 22^(k*(nk)), read by rows.
 A176635 (program): a(n) = 6a(n1)8a(n2) for n > 1; a(0) = 57, a(1) = 242.
 A176636 (program): Periodic sequence: Repeat 57, 71.
 A176639 (program): Triangle T(n, k) = 15^(k*(nk)), read by rows.
 A176640 (program): Partial sums of A005985.
 A176641 (program): Triangle T(n, k) = 28^(k*(nk)), read by rows.
 A176642 (program): Triangle T(n, k) = 8^(k*(nk)), read by rows.
 A176643 (program): Triangle T(n, k) = 21^(k*(nk)), read by rows.
 A176646 (program): a(n) is the number of convex pentagons in an ntriangular net.
 A176662 (program): a(0)=2, a(1)=7, and a(n) = (3n+1)2^(n1) if n > 1.
 A176672 (program): a(2n) = 1 + 6n, a(2*n+1) = A165367(n).
 A176691 (program): a(n) = 2^n + 2*n + 1.
 A176693 (program): Union of squares and the even numbers.
 A176708 (program): Partial sums of A094820.
 A176710 (program): Mix A001021, 2*A001021.
 A176711 (program): a(n) = 16n^4 + 64n^3 + 104n^2 + 80n + 21.
 A176712 (program): a(n) = 16n^4 + 256n^3 + 1160n^2 + 1088n + 285.
 A176730 (program): Denominators of coefficients of a series, called f, related to Airy functions.
 A176731 (program): Denominators of coefficients of a series, called g, related to Airy functions.
 A176737 (program): Expansion of 1 / (14x^23x^3). (4,3)Padovan sequence.
 A176738 (program): Expansion of 1 / ((1+x)(1x4x^2)). (5,4)Padovan sequence.
 A176742 (program): Expansion of (1  x^2) / (1 + x^2) in powers of x.
 A176743 (program): a(n) = gcd(A000217(n+1), A002378(n+2)).
 A176776 (program): a(n) = 2^nn*(n2).
 A176777 (program): 2^nn*(n3).
 A176778 (program): 2^nn*(n+2).
 A176780 (program): a(n) = n^4 + 6n^3 + 14n^2 + 15n + 6.
 A176798 (program): Triangle read by rows: T(n,m)=1 + n(2m + 1 + n)/2, 0<=m<=n.
 A176805 (program): a(n) = 3^n + 3*n + 1.
 A176808 (program): Triangle read by rows: T(n,m)=Floor[(n  1)/m], 1<=m<=n.
 A176814 (program): The number of iterations needed to reach 1 under the map n> nbigomega(n)).
 A176816 (program): The number of steps to reach 0 under the map x > xtau(sigma(x)), starting at n.
 A176823 (program): a(n)=Mod(n^(n+1),(n+1)^n).
 A176824 (program): a(n) = (n+1)^n mod n^n.
 A176835 (program): Number of positive integers k for which k^2  n*k is a square.
 A176839 (program): The number of iterations to reach 1 under the map x > xtau(phi(x)), starting at n.
 A176841 (program): a(n) is the number of iterations of f(n) = nphi(tau(n)) needed to reach 1.
 A176844 (program): The number of iterations of the map n > n  bigomega(sigma(n)) until reaching 1.
 A176846 (program): Number of iterations of the map n> n  sigma(bigomega(n)) needed to reach 1.
 A176849 (program): Triangle read by rows which contains the (6n)th row of the Pascal triangle in row n.
 A176889 (program): a(2k1)=1, a(2k)=2*k^2 (definition by T. M. Apostol, see References).
 A176895 (program): Period 4: repeat [1, 4, 2, 4].
 A176900 (program): sin((2n+5)Pi/6)(n+1)2^(n+1)
 A176916 (program): 5^n + 5n + 1.
 A176961 (program): a(n) = (3*2^(n+1)  8  (2)^n)/6.
 A176963 (program): a(n) = (104^n  3(4)^n  22)/30.
 A176965 (program): a(n) = 2^(n1)  (2^n*(1)^n + 2)/3.
 A176972 (program): a(n) = 7^n + 7*n + 1.
 A176974 (program): First exponent n to generate maximum remainder when (a + 1)^n + (a  1)^n is divided by a^2 for variable n and a>2.
 A176981 (program): Expansion of 1+(12x)/(1+2x+x^2).
 A177002 (program): Period 4: repeat [1, 2, 4, 2].
 A177018 (program): a(n) is the smallest integer >= a(n1) such that a(n) + A067076(n) + n1 is an odd prime.
 A177019 (program): a(n) = (310^(2n)+3*10^n+1), (n>=0).
 A177022 (program): Decimal expansion of 49/36.
 A177023 (program): a(n) = 2^(2n) mod (2n+1).
 A177025 (program): Number of ways to represent n as a polygonal number.
 A177044 (program): a(n) = 103*(n1)a(n1) with n>1, a(1)=38.
 A177046 (program): a(n) = 127*(n1)a(n1) with n>1, a(1)=16.
 A177049 (program): Numerator of (3n+1)*(3n+2)/4.
 A177057 (program): Decimal expansion of 7/6.
 A177058 (program): n^3  3n^2 + 3.
 A177059 (program): a(n) = 25n^2 + 25n + 6.
 A177060 (program): (7n+2)(7n+5)=49n^2+49*n+10
 A177065 (program): a(n) = (8n+3)(8*n+5).
 A177068 (program): 10^n+n^10
 A177069 (program): 11^n + n^11.
 A177071 (program): (7n + 3)(7n + 4).
 A177072 (program): (9n+2)(9*n+7).
 A177073 (program): (9n+4)(9*n+5).
 A177074 (program): 3*(10^n5).
 A177075 (program): n^5  n^3  2n^2 + 1.
 A177079 (program): 5*(10^n3)
 A177080 (program): a(n) = 5*(10^n7).
 A177082 (program): a(n) = 2nA071148(n).
 A177090 (program): a(n) = a(n1) + 12*100^(n1), with a(0)=0.
 A177095 (program): 9^n  8.
 A177096 (program): 5*(10^n2).
 A177097 (program): 6*(10^n5)
 A177098 (program): 6*(10^n7)
 A177099 (program): a(n) = 81n^2 + 2n.
 A177100 (program): Partial sums of round(n^2/9).
 A177102 (program): Beatty sequence for sqrt(10).
 A177107 (program): 3*(10^n7).
 A177108 (program): a(n) = 4*(10^n3).
 A177109 (program): a(n) = 4*(10^n5).
 A177112 (program): 4*(10^n7).
 A177114 (program): 4*(10^n9).
 A177116 (program): Partial sums of round(n^2/11).
 A177138 (program): Numbers of the form (n!*(n+1))/2 with n or (n+1) prime.
 A177145 (program): E.g.f.: arcsin(x).
 A177151 (program): a(n) = least k such that 1 + 1/4 + 1/9 + … + 1/k^2 exceeds (Pi^2)(n1)/(6n).
 A177152 (program): Positions in A177151 of runs of length 1.
 A177154 (program): Fractional part of the conversion from degrees Centigrade (or Celsius) to Fahrenheit.
 A177176 (program): Partial sums of round(n^2/13).
 A177189 (program): Partial sums of round(n^2/16).
 A177205 (program): Partial sums of round(n^2/17).
 A177206 (program): a(n) = 2*binomial(n+4, 4) + n + 4.
 A177227 (program): Triangle T(n,m) read by rows: equals binomial(n,m) in general, but 2 if n=m or m=0.
 A177228 (program): A combinatorial differential triangle sequence:q=3;t=1/q;f(t,n)=d^n/dt^n(t/(1+t); c(t.n,m)=(1/(1+t)f(n,t)/(f(t,m)*f(t,(nm))
 A177229 (program): A combinatorial differential triangle sequence:q=4;t=1/q;f(t,n)=d^n/dt^n(t/(1+t); c(t.n,m)=(1/(1+t)f(n,t)/(f(t,m)*f(t,(nm))
 A177234 (program): a(n) = binomial(n^2, n)/(n+1).
 A177237 (program): Partial sums of round(n^2/19).
 A177239 (program): Partial sums of round(n^2/20).
 A177265 (program): Number of permutations of 1,2,…,n having exactly one string of consecutive fixed points (including singletons).
 A177274 (program): Periodic sequence: Repeat 1, 2, 3, 4, 5, 6, 7, 8, 9.
 A177277 (program): Partial sums of round(n^2/28).
 A177332 (program): Partial sums of round(n^2/29).
 A177337 (program): Partial sums of round(n^2/36).
 A177339 (program): Partial sums of round(n^2/44).
 A177342 (program): a(n) = (4n^33n^2+5*n3)/3.
 A177346 (program): Decimal expansion of (1+sqrt(10))/3.
 A177357 (program): Number of positive squares <= prime(n)  3.
 A177400 (program): a(n) = binomial(n*2^n, n).
 A177424 (program): Exponent of the highest power of 2 dividing binomial(n^2,n).
 A177444 (program): Triangle by columns, (1, 1, 0, 1, 0, 0, 0,…); shifted down twice for columns >0.
 A177452 (program): Partial sums of A002055.
 A177454 (program): ( binomial(2*p,p)  2)/p where p = prime(n).
 A177456 (program): a(n) = binomial(n^2,n+1)/n.
 A177499 (program): Period 4: repeat [1, 16, 4, 16].
 A177698 (program): Expansion of e.g.f.: sin(arctan(x)).
 A177702 (program): Period 3: repeat [1, 1, 2].
 A177703 (program): Decimal expansion of (2+sqrt(10))/3.
 A177704 (program): Period 4: repeat [1, 1, 1, 2].
 A177706 (program): Period 5: repeat [1, 1, 1, 1, 2].
 A177712 (program): Even numbers that have a nontrivial odd divisor.
 A177747 (program): Convolution of A008805 (triangular numbers repeated) with itself.
 A177755 (program): Number of ways to place 2 nonattacking bishops on an n X n toroidal board.
 A177756 (program): Number of ways to place 3 nonattacking bishops on an n X n toroidal board.
 A177769 (program): a(n) = 111*n.
 A177771 (program): Factorial of (prime(n)  1).
 A177784 (program): a(n) = binomial(n^2, n) / ( n*(n+1) ).
 A177787 (program): Number of paths from (0,0) to (n+2,n) using only up and right steps and avoiding two or more consecutive moves up or three or more consecutive moves right.
 A177788 (program): binomial(n^2,n+1)/(n1).
 A177837 (program): Binomial(n^3,n) / (n^2 * (n^2+n+1) ), or binomial(n^32,n2).
 A177853 (program): Partial sums of A018805.
 A177863 (program): Product modulo p of the quadratic nonresidues of p, where p = prime(n).
 A177868 (program): a(n) = number of 2digit primes with digit sum n, where n runs through the nonmultiples of 3 in the range [2..17].
 A177870 (program): Decimal expansion of 3*Pi/4.
 A177881 (program): Partial sums of round(3^n/10).
 A177882 (program): Trisection of A001317.
 A177883 (program): Period 6: repeat [4, 5, 7, 2, 1, 8].
 A177885 (program): a(n) = (1n)^(n1).
 A177890 (program): 15gonal (or pentadecagonal) pyramidal numbers: a(n) = n(n+1)(13*n10)/6.
 A177892 (program): The number of distinct prime factors in LucasLehmer number A003010(n).
 A177897 (program): Triangle of octanomial coefficients read by rows: nth row is obtained by expanding ((1+x)(1+x^2)(1+x^4))^n ] mod 2 and converting to decimal.
 A177949 (program): First string of 43 consecutive composite numbers.
 A177959 (program): nth prime minus number of 0’s in binary representation of nth prime.
 A177964 (program): Indices m for which A177961(m) = 4.
 A177965 (program): Indices m for which A177961(m)  m = 1.
 A177980 (program): Iterate (n + lpf(n)) / 2 until a prime is reached, where lpf equals the least prime factor. a(n) is that terminating prime.
 A177990 (program): Triangle read by rows, variant of A070909, a cellular automaton
 A178027 (program): Multiples of 5291.
 A178058 (program): Number of 1’s in the Gray code for binomial(n,m).
 A178069 (program): a(n) = 12345679 * A001651(n).
 A178073 (program): Partial sums of sequence A177342.
 A178096 (program): Cube of n is equal to sum of four positive distinct squares; n^3=a^2+b^2+c^2+d^2; a>b>c>d>0.)
 A178129 (program): Partial sums of A050508.
 A178142 (program): Sum over the divisors d = 2 and/or 3 of n.
 A178143 (program): Sum of squares d^2 over the divisors d=2 and/or d=3 of n.
 A178144 (program): Sum of divisors d of n which are d=2, 3 or 5.
 A178146 (program): a(n) is the number of distinct divisors d of n of the form d=2,3 or 5
 A178166 (program): 10^a(n) Pascal triangle, where a(n) = A007318(n).
 A178168 (program): Product of the numbers in the Collatz (3x+1) trajectory of n, including n.
 A178181 (program): Minute with hour hand overlap problem on analog clock.
 A178182 (program): Minimal polynomials of sin(2Pi/n) are mapped to those of cos(2Pi/a(n)).
 A178184 (program): Sum 2^((k^2+3k)/2) from k=1 to n
 A178185 (program): Numerators of sum (1/2)^((k^2+3k)/2) from k=1 to n.
 A178186 (program): Sum 3^((k^2+3k)/2) from k=1 to n.
 A178187 (program): Numerators of sum (1/3)^((k^2+3k)/2) from k=1 to n.
 A178207 (program): a(n) = 4n  2A000120(n) + 1 where A000120(n) = number of nonzero digits in the binary representation of n.
 A178208 (program): Number of ways to choose three points in an (n X n)grid (or geoplane).
 A178211 (program): prime(n)^2 mod n.
 A178218 (program): Numbers of the form 2k^22k+1 or 2k^21.
 A178222 (program): Partial sums of floor(3^n/4).
 A178225 (program): Characteristic function of A006995 (binary palindromes).
 A178226 (program): Characteristic function of A154809 (numbers that are not binary palindromes)
 A178242 (program): Numerator of n(5+n)/((n+1)(n+4)).
 A178244 (program): Number of distinct transpositions of binary digits (0’s and 1’s) in n.
 A178248 (program): a(n) = 12^n + 1.
 A178255 (program): Decimal expansion of (3+sqrt(17))/2.
 A178300 (program): Triangle T(n,k) = binomial(n+k1,n) read by rows, 1 <= k <= n.
 A178305 (program): a(0)=1, a(1)=a(2)=1 and a(3k)=a(k), a(3k+1) = a(3k+2) = 2a(k) for k >= 1.
 A178312 (program): a(n) = n * T(ceiling(n/2)), where T are the triangular numbers, A000217.
 A178333 (program): Characteristic function of mountain numbers.
 A178334 (program): Number of mountain numbers <= n.
 A178348 (program): a(n) = Sum_ k=0..n 1100^k.
 A178349 (program): Partial sums of sum_ n=0…infinity 1010^n.
 A178359 (program): Rounded up arithmetic mean of digits of n appended to n, cf. A004427.
 A178370 (program): The trisection A178242(3n+2).
 A178389 (program): Multiples of 3 in A175461.
 A178390 (program): a(n) = (n^2+1)^2+1.
 A178391 (program): a(n) = (n^3+1)^3+1.
 A178392 (program): a(n) = (n^21)^21.
 A178393 (program): a(n) = (n^31)^31.
 A178395 (program): Triangle T(n,m) read by rows: the numerator of the coefficient [x^m] of the inverse Euler polynomial E^ 1 (n,x), 0 <= m <= n.
 A178397 (program): Partial sums of round(7^n/10).
 A178398 (program): a(n) = p(p+1)^2, where p is the nth prime.
 A178414 (program): Least odd number in the Collatz (3x+1) preimage of odd numbers not a multiple of 3.
 A178420 (program): Partial sums of floor(2^n/3).
 A178440 (program): Convolution square of A058187, the tetrahedral series with repeats.
 A178445 (program): Prime(n)^2 mod n^2.
 A178452 (program): Partial sums of floor(2^n/5).
 A178455 (program): Partial sums of floor(2^n/7).
 A178457 (program): Partial sums of floor(2^n/23).
 A178459 (program): Partial sums of floor(2^n/31).
 A178460 (program): Partial sums of floor(2^n/127).
 A178464 (program): Minimal number of lines that must be removed from an n X n square array of cells in order to break all rectangles.
 A178465 (program): Expansion of 2x^2(32x+x^2x^32x^4+x^5) / ( (1+x)^2*(x1)^4 ).
 A178474 (program): Triangle T(n,m) read by rows: the denominator of the coefficient [x^m] of the inverse Euler polynomial E^ 1 (n,x), 0<=m<=n.
 A178487 (program): a(n) = floor(n^(1/5)): integer part of fifth root of n.
 A178489 (program): a(n) = floor(n^(1/6)): integer part of sixth root of n.
 A178493 (program): Numbers of powers of phi in basephi expansion of phiantipalindromic numbers (A178482).
 A178500 (program): a(n) = 10^n * signum(n).
 A178501 (program): Zero followed by powers of ten.
 A178512 (program): Reversed decimal expansions of A178510.
 A178513 (program): Partial sums of 80^n
 A178521 (program): The cost of all leaves in the Fibonacci tree of order n.
 A178523 (program): The path length of the Fibonacci tree of order n.
 A178525 (program): The sum of the costs of all nodes in the Fibonacci tree of order n.
 A178532 (program): Partial sums of problimes (third definition, A003068).
 A178536 (program): First column of A178535.
 A178537 (program): (2n+1)^(2n+1) mod 2^(2n+1).
 A178543 (program): Partial sums of round(3^n/5).
 A178572 (program): Numbers with ordered partitions that have periods of length 5.
 A178574 (program): a(n) = 2n(9*n1).
 A178577 (program): Partial sums of round(5^n/9).
 A178596 (program): Records in A039996.
 A178600 (program): Expansion of the polynomial (1+x^3)*(1+x^11).
 A178617 (program): a(n) = n^4  (n+1)^3.
 A178630 (program): a(n) = 18 * ((10^n  1)/9)^2.
 A178631 (program): a(n) = 27 * ((10^n  1)/9)^2.
 A178632 (program): a(n) = 45 * ((10^n  1)/9)^2.
 A178633 (program): a(n) = 54*( (10^n  1)/9 )^2.
 A178634 (program): a(n) = 63 * ((10^n  1)/9)^2.
 A178635 (program): a(n) = 72 * ((10^n  1)/9)^2.
 A178664 (program): 2^n concatenated with itself.
 A178671 (program): a(n) = 5^n  5.
 A178672 (program): a(n) = 6^n  6.
 A178674 (program): a(n) = 3^n + 3.
 A178675 (program): a(n) = 4^n + 4.
 A178676 (program): a(n) = 5^n + 5.
 A178681 (program): a(n) = 6^n + 6.
 A178703 (program): Partial sums of round(3^n/7).
 A178704 (program): Partial sums of floor(3^n/7).
 A178706 (program): Partial sums of floor(3^n/5).
 A178710 (program): Partial sums of floor(4^n/7).
 A178719 (program): Partial sums of (1/5)*floor(6^n/7).
 A178729 (program): a(n) = n XOR 3n, where XOR is bitwise XOR.
 A178730 (program): Partial sums of floor(7^n/8)/6.
 A178731 (program): a(n) = n XOR 5n, where XOR is bitwise XOR.
 A178732 (program): a(n) = n XOR 6n, where XOR is bitwise XOR.
 A178733 (program): a(n) = n XOR 7n, where XOR is bitwise XOR.
 A178734 (program): a(n) = n XOR 8n, where XOR is bitwise XOR.
 A178735 (program): a(n) = n XOR 9n, where XOR is bitwise XOR.
 A178736 (program): a(n) = n XOR 10n, where XOR is bitwise XOR.
 A178741 (program): a(1)=2. For a(n)+1, differences must be strictly increasing and consecutive terms are relatively prime
 A178742 (program): Partial sums of floor(2^n/9).
 A178744 (program): Partial sums of floor(4^n/9).
 A178746 (program): Binary counter with intermittent bits. Starting at zero the counter attempts to increment by 1 at each step but each bit in the counter alternately accepts and rejects requests to toggle.
 A178759 (program): Expansion of e.g.f. 3xexp(x)*(exp(x)1)^2.
 A178769 (program): a(n) = (5*10^n + 13)/9.
 A178778 (program): Partial sums of walks of length n+1 on a tetrahedron A001998.
 A178789 (program): 4^(n1) + 2: Number of acute angles after n iterations of the Koch snowflake construction.
 A178804 (program): When dealing cards into 3 piles (Left, Center, Right), the number of cards in the nth card’s pile, if dealing in a pattern L, C, R, C, L, C, R, C, L, C, … [as any thoughtful sixyearold will try to do when sharing a pile of candy among 3 people].
 A178815 (program): First base of a nonzero Fermat quotient mod the nth prime.
 A178827 (program): Partial sums of floor(8^n/9)/7.
 A178828 (program): Partial sums of floor(3^n/10)/2.
 A178829 (program): Partial sums of (1/2)*floor(7^n/10).
 A178832 (program): Number of minima of the 1D Griewank function in [n, n].
 A178842 (program): a(n) = binomial((n1)^2, n).
 A178853 (program): “Josephus problem”: n persons stand in a circle and eliminate every seventh person counting clockwise until only person a(n) is remaining.
 A178855 (program): Partial sums of A033485.
 A178872 (program): Partial sums of round(4^n/7).
 A178873 (program): Partial sums of round(5^n/7).
 A178874 (program): Partial sums of round(5^n/8).
 A178875 (program): Partial sums of round(4^n/9).
 A178881 (program): Sum of all pairs of greater common divisors for (i,j) where 1 <= i < j <= n.
 A178890 (program): a(n) = n OR 3n, where OR is bitwise OR.
 A178891 (program): a(n) = n OR 4n, where OR is bitwise OR.
 A178892 (program): a(n) = n OR 5n, where OR is bitwise OR.
 A178893 (program): a(n) = n OR 6n, where OR is bitwise OR.
 A178894 (program): a(n) = n OR 7n, where OR is bitwise OR.
 A178895 (program): a(n) = n OR 8n, where OR is bitwise OR.
 A178896 (program): a(n) = n OR 9n, where OR is bitwise OR.
 A178897 (program): a(n) = n OR 10n, where OR is bitwise OR.
 A178901 (program): a(1)=2; for n > 1, a(n) is the largest number <= 2*a(n1) divisible by n.
 A178914 (program): 10’s complement of nonnegative numbers.
 A178915 (program): Rearrangement of natural numbers so that every partial sum is composite.
 A178922 (program): a(n) = (n+1)^n  n^(n1) for n > 0, a(0) = 1.
 A178935 (program): a(n) = floor((34^n  23^n)/5).
 A178936 (program): Floor((23^n+32^n)/5).
 A178945 (program): Expansion of x(1x)^2/( (12x^2)(12x)^2).
 A178946 (program): a(n) = n(n+1)(2n+1)/6  nfloor(n/2).
 A178947 (program): Expansion of x(1+2x+8x^2+3x^4+4x^3) / ( (1+x)^2(x1)^4 ).
 A178960 (program): Numbers n such that n! contains every digit at least once.
 A178965 (program): a(n) = numerator of Sum_ k>=1 floor(n/k)/2^k.
 A178969 (program): Last nonzero decimal digit of (10^10^n)!
 A178970 (program): 2^(2n1) mod (2n+1).
 A178977 (program): a(n) = (3n+2)(3*n+5)/2.
 A178978 (program): a(n) = A144448(n+1)/8.
 A178982 (program): Partial sums of floor(Fibonacci(n)/2).
 A178987 (program): a(n) = n(n3)2^(n2).
 A178999 (program): Number of nnode simple graphs that are not determined by their resistance distance multisets.
 A179001 (program): Partial sums of floor(Fibonacci(n)/3).
 A179005 (program): Indices of nonprime repunits: nonnegative numbers n such that 11…111 = (10^n  1)/9 is composite.
 A179006 (program): Partial sums of floor(Fibonacci(n)/4).
 A179018 (program): Partial sums of ceiling(Fibonacci(n)/2).
 A179020 (program): Doubled ThueMorse sequence: the A010059 sequence replacing 0 with 0,0 and 1 with 1,1.
 A179023 (program): a(n) = n(F(n+2)  1) where F(n) is defined by A000045.
 A179041 (program): Partial sums of ceiling(Fibonacci(n)/3).
 A179042 (program): Partial sums of ceiling(Fibonacci(n)/4).
 A179044 (program): Decimal expansion of (5/18)Pi. Decimal expansion of, asymptotically, the probability that the evolution of a random graph ever simultaneously has two complex components.
 A179054 (program): a(n) = (1^k + 2^k + … + n^k) modulo (n+2), where k is any odd integer greater than or equal to 3.
 A179058 (program): Number of nonattacking placements of 3 rooks on an n X n board.
 A179059 (program): Number of nonattacking placements of 4 rooks on an n X n board.
 A179060 (program): Number of nonattacking placements of 5 rooks on an n X n board.
 A179061 (program): Number of nonattacking placements of 6 rooks on an n X n board.
 A179062 (program): Number of nonattacking placements of 7 rooks on an n X n board.
 A179063 (program): Number of nonattacking placements of 8 rooks on an n X n board.
 A179064 (program): Number of nonattacking placements of 9 rooks on an n X n board.
 A179065 (program): Number of nonattacking placements of 10 rooks on an n X n board.
 A179070 (program): a(1)=a(2)=a(3)=1, a(4)=3; thereafter a(n) = a(n1) + a(n3).
 A179081 (program): Parity of sum of digits of n.
 A179088 (program): Positive integers of the form (2*m^2+1)/11.
 A179095 (program): Rectified 5cell numbers: the coefficient of x^ 2n2 in (1+x+x^2+ … + x^ n1 )^5.
 A179103 (program): A variation on A119505 that gives a limited digit set 2, 3, 4, 6, 8 .
 A179111 (program): Partial sums of round(Fibonacci(n)/11).
 A179125 (program): a(n) = A000037(n)^3.
 A179126 (program): Positive integers n for which the torsion subgroup of the elliptic curve y^2 = x^3 + n has order 3.
 A179135 (program): a(n) = (3sqrt(5))((3+sqrt(5))/10)^(n)/2+(3+sqrt(5))((3sqrt(5))/10)^(n)/2.
 A179167 (program): a(n) red and b(n) blue balls in an urn; draw 3 balls without replacement; Probability(3 red balls) = Probability(1 red and 2 blue balls); binomial(a(n),3) = binomial(a(n),1)*binomial(b(n),2).
 A179178 (program): The number of equalsized equilateral triangles visible (when viewed from above) in successive Genealodrons formed from 2^n 1 same size equilateral triangles.
 A179180 (program): Partial sums of A007895.
 A179184 (program): Number of connected 2regular simple graphs with n vertices.
 A179207 (program): a(n) = n  1 + ceiling((3 + n^2)/2) if n > 1 with a(1)=1, complement of A182835.
 A179237 (program): a(0) = 1, a(1) = 2; a(n+1) = 6*a(n) + a(n1) for n>1.
 A179257 (program): Number of permutations of length n which avoid the patterns 321 and 1324.
 A179259 (program): Arises in covering a graph by forests and a matching.
 A179262 (program): a(n) = 2*prime(n)^2  1.
 A179272 (program): Sharp upper bound on Rosgen overlap number nvertex graph with n => 14, formula abused here for nonnegative integers.
 A179276 (program): Largest 3smooth number <= n.
 A179278 (program): Largest nonprime integer not less than n.
 A179297 (program): a(n) = n^2  (n1)^2  (n2)^2  …  1^2.
 A179298 (program): a(n)=n^3(n1)^3(n2)^3…1.
 A179312 (program): Largest semiprime dividing n, or 0 if no semiprime divides n.
 A179329 (program): Number of iterations of (n + lpf(n)) / 2 required to reach a prime, where lpf equals the least prime factor.
 A179337 (program): Positive integers of the form (6*m^2 + 1)/11.
 A179338 (program): Positive integers of the form (10*m^2+1)/11.
 A179339 (program): Positive integers of the form (30*m^2+1)/11.
 A179370 (program): Positive integers of the form (7*m^2+1)/11.
 A179403 (program): Number of ways to place 2 nonattacking kings on an n X n toroidal board.
 A179431 (program): a(n) = binomial(3^(n1), n).
 A179432 (program): a(n) = C(2*3^(n1), n).
 A179436 (program): a(n) = (3n+7)(3*n+2)/2.

A179437 (program): 2n  prime(n) .  A179442 (program): a(n) = ((n1)! * (n+1)!) / n.
 A179477 (program): Antonym of A014824: each term is 10 times the previous term minus n.
 A179508 (program): a(n) is the unique integer such that Sum_ k=0..p1 b(k)/(n)^k == a(n) (mod p) for any prime p not dividing n, where b(0), b(1), b(2), … are Bell numbers given by A000110.
 A179526 (program): (3^k  1)/2 appears 3^(k1) times, k>0.
 A179532 (program): a(n) = 2^ceiling(n*(n+1)/3).
 A179541 (program): a(n) is the least possible smallest period attainable by the action of a periodic sequence of binary operations <+>,<> (see A179382,A179480), beginning with 2n1<+>1 or 2n1<>1
 A179545 (program): The sum of the elements within a jump in a Sieve of Eratosthenes table.
 A179546 (program): a(n) = p^2*(p + 3)/2, where p = prime(n).
 A179555 (program): a(1)=10; a(n) = a(n1)*10  1.
 A179571 (program): Number of permutations of 1..n+4 with the number moved left exceeding the number moved right by n.
 A179579 (program): Number of permutations of 1..n+4 with the number moved left exceeding the number moved right by n or more.
 A179607 (program): Eight white kings and one red king on a 3 X 3 chessboard. G.f.: (1 + 2x  4x^2)/(1  2x  8x^2).
 A179608 (program): a(n) = (7 + (1)^n + 6n)2^(n3).
 A179609 (program): a(n)=(5(1)^n6n)2^(n2)
 A179619 (program): a(1)=1, a(n+1) = 10a(n)+2n1
 A179635 (program): Median of the digits in n (rounding down).
 A179645 (program): a(n) = prime(n)^8.
 A179656 (program): prime(n) mod (digital root(prime(n))).
 A179665 (program): a(n) = prime(n)^9.
 A179741 (program): a(n) = (2n+1)(6*n1).
 A179744 (program): a(0) = 1, a(n) = 3*2^(n1)  n for n>0.
 A179753 (program): Integers (2k)1..0 followed by integers (2k)+1..0 and so on.
 A179783 (program): a(n) = 2n(n+1)*(n+2)/3 + (1)^n.
 A179802 (program): Digital root of A179545.
 A179805 (program): a(0) = 1, a(1) = 3, a(2) = 6 and a(n) = 2*a(n1)  a(n2) for n > 3.
 A179819 (program): Numbers of cents such that the shortest way to get the value uses all denominations of dime and above
 A179820 (program): a(n) = nth triangular number mod (n+2).
 A179824 (program): Chromatic polynomial of the star graph on 4 vertices (claw graph) and the path graph on 4 vertices.
 A179850 (program): Characteristic function of numbers that are congruent to 0, 1, 3, 4 mod 5.
 A179854 (program): Number of 0’s (mod 3) in the binary expansion of n.
 A179865 (program): Number of nbit binary numbers containing one run of 0’s.
 A179867 (program): “Recurrence function” for ThueMorse infinite word A010060.
 A179868 (program): (Number of 1’s in the binary expansion of n) mod 4.
 A179870 (program): a(n) = ((n1)! * (n+1)!) ^ 2.
 A179892 (program): Numbers which are not the sum of three distinct members of twin primes.
 A179893 (program): a(n) = 3/2 * (prime(n)1).
 A179894 (program): Given the series (1, 2, 1, 2, 1, 2, …), let (1 + 2x + x^2 + 2x^3 + …) * (1 + 2x^2 + x^3 + 2x^4 + …) = (1 + 2x + 3x^2 + 7x^3 + …)
 A179896 (program): Sum of the numbers between k := nth nonprime and 2k (like a jump in a Sieve of Eratosthenes).
 A179897 (program): Numbers a_n with property that a(n) is arithmetic mean of sequence “ntimes n^1, once n^(2*n+1)” that has integer valued both arithmetic and geometric means even though some of the sequence members are (for n>1) noninteger.
 A179903 (program): (1, 3, 5, 7, 9…) convolved with (1, 0, 3, 5, 7, 9,…)
 A179904 (program): a(n) = A056520(n)+1 for n>0, a(0)=1.
 A179905 (program): (1, 4, 7, 10, 13,…) convolved with (1, 0, 4, 7, 10, 13…); given A016777 = (1, 4, 7, 10, 13,…).
 A179907 (program): Numerators in the approximation of sqrt(2) satisfying the recurrence: a(n)= [a(n1)*a(n2)+2]/[a(n1)+a(n2)] with a(1)=a(2)=1
 A179930 (program): a(n) = gcd(n, A001157(n)).
 A179935 (program): Squares where the number of decimal digits is also a square.
 A179956 (program): a(n) is the smallest integer that contains a(n1) but does not begin with a(n1).
 A179976 (program): 2^(2n+1) mod (2n+1).
 A179986 (program): Second 9gonal (or nonagonal) numbers: a(n) = n(7n+5)/2.
 A179991 (program): Nonhomogeneous threeterm sequence a(n) = a(n1) + a(n2) + n.
 A179992 (program): Extended three term Fibonacci sequence a(n)=a(n1)+a(n2)+n^2. a(1)=2; a(2)=5
 A179995 (program): Generating function A(5,t)(1+t+t^2)/(1t)^6, where A(5,t) is an Eulerian polynomial.
 A179999 (program): Length of the nth term in the modified Look and Say sequence A110393.
 A180004 (program): Nearest integer to n*(27/26)
 A180017 (program): Difference of sums of digits of n in ternary and in binary.
 A180027 (program): Partial sums of sigma_A100706(n).
 A180030 (program): Number of nmove paths on a 3 X 3 chessboard of a queen starting or ending in a corner or side square.
 A180033 (program): Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 + x)/(1  5x  5x^2).
 A180034 (program): Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1  2x)/(1  6x + 2*x^2).
 A180037 (program): Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1+x)/(15x2x^2).
 A180064 (program): a(n) = n!/A056040(n).
 A180094 (program): Number of steps to reach 0 or 1, starting with n and applying the map k > (number of 1’s in binary expansion of k) repeatedly.
 A180102 (program): a(1)=1; a(n)=percentage of sum of previous terms represented by n
 A180103 (program): Floor( 100*(n1)/n ).
 A180104 (program): Floor( 100*n/(n1) ).
 A180118 (program): a(n) = Sum_ k=1..n (k+2)!/k! = Sum_ k=1..n (k+2)*(k+1).
 A180119 (program): a(n) = (n+2)! * Sum_ k = 1..n 1/((k+1)*(k+2)).
 A180122 (program): First of three “least, sum, least” selfgenerating sequences.
 A180123 (program): Second of three “least, sum, least” selfgenerating sequences.
 A180124 (program): Third of three “least, sum, least” selfgenerating sequences.
 A180142 (program): Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x  x^2)/(1  3x  3x^2).
 A180143 (program): Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x^2)/(1  4x + x^2 + 2x^3).
 A180144 (program): Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1  2x^2)/(1  4x + x^2 + 2*x^3).
 A180148 (program): a(n) = 3*a(n1) + a(n2) with a(0)=2 and a(1)=5.
 A180167 (program): a(0) = 1, a(1) = 7; a(n)= 6a(n1) + 6a(n2) for n>1.
 A180172 (program): a(n) = gcd(prime(n)+2, n).
 A180173 (program): a(n) = gcd(prime(n)2, n).
 A180189 (program): Number of permutations of [n] having exactly 1 circular succession. A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.
 A180201 (program): Inverse permutation to A180200.
 A180217 (program): a(n) = (nth prime modulo 3) + (nth prime modulo 4).
 A180222 (program): a(n) = 4a(n1) + 8a(n2), with a(1)=0 and a(2)=1.
 A180223 (program): a(n) = (11n^2  7n)/2.
 A180232 (program): a(n) = n(17n  13)/2.
 A180250 (program): a(n) = 5a(n1) + 10a(n2), with a(1)=0 and a(2)=1.
 A180255 (program): a(n)=n^2*a(n1)+n, a(0)=0.
 A180270 (program): Integers of the form (k^12  k^8  k^4 + 1)/512.
 A180272 (program): a(n) = binomial(n, A002024(n+1)1) where A002024 is “n appears n times”.
 A180291 (program): Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n1.
 A180316 (program): Concatenation of n and A008954(n).
 A180319 (program): Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere
 A180324 (program): Vassiliev invariant of fourth order for the torus knots
 A180354 (program): a(n) = n^4 + 4*n.
 A180355 (program): n^5+5n
 A180356 (program): n^6+6n
 A180357 (program): a(n) = n^7 + 7*n.
 A180358 (program): n^8+8n
 A180359 (program): n^9+9n
 A180363 (program): L(prime(n)), where L(i) is a Lucas number (A000032).
 A180413 (program): Total number of possible knight moves on an n X n X n chessboard, if the knight is placed anywhere.
 A180415 (program): (n^3  3n^2 + 14n  6)/6.
 A180433 (program): Binary string formed from the binary expansion of Pi by exchanging 0’s and 1’s.
 A180434 (program): Decimal expansion of constant (2  Pi/2).
 A180444 (program): a(n) equals the number of bispecial Sturmian words of length n, that is words which are prefix to two words of length n+1, and likewise suffix. Note that prefix and suffix are not independent, unless the word is also palindromic: see A000010.
 A180446 (program): Number of nonpentagonal numbers <= n.
 A180447 (program): n appears 3n+1 times.
 A180458 (program): Largest palindromic number <= nthprime.
 A180486 (program): Numbers of the form ceiling(A179896(j)/A018252(j)) where A179896(j) mod A018252(j) <> 0.
 A180491 (program): Product of remainders of n mod k, for k = 2,3,4,…,n1.
 A180497 (program): a(n)=n^23*floor[n/sqrt(3)]^2
 A180498 (program): a(n) = n^2  5*floor(n/sqrt(5))^2.
 A180511 (program): Fermat quotients for base 4: (4^(p  1)  1)/p, where p = prime(n).
 A180516 (program): Numbers of the form i*4^j1 (i=1..3, j >= 0).
 A180569 (program): The Wiener index of the P_3 x P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph.
 A180571 (program): The Wiener index of the graph /\/\/…\/_/ having n nodes on the horizontal path.
 A180574 (program): Wiener index of the nsunlet graph.
 A180576 (program): Wiener index of the nweb graph.
 A180577 (program): The Wiener index of the windmill graph D(6,n). The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs).
 A180578 (program): The Wiener index of the Dutch windmill graph D(6,n) (n>=1).
 A180579 (program): The Wiener index of the Dutch windmill graph D(5,n) (n>=1).
 A180592 (program): Digital root of 2n.
 A180593 (program): Digital root of 3n.
 A180594 (program): Digital root of 4n.
 A180595 (program): Digital root of 5n.
 A180596 (program): Digital root of 6n.
 A180597 (program): Digital root of 7n.
 A180598 (program): Digital root of 8n.
 A180599 (program): Zero followed by infinitely many 9’s.
 A180602 (program): (2^(n+1)  1)^n.
 A180613 (program): The number of palindromic primes in the first n terms of A006530.
 A180617 (program): Sum of divisors of the product of two consecutive primes.
 A180633 (program): a(n) is the number of iterations of function f(x) = phi(x)1 needed before zero is reached, when starting from the initial value x = n.
 A180662 (program): The Golden Triangle: T(n,k) = A001654(k) for n>=0 and 0<=k<=n.
 A180663 (program): Mirror image of the Golden Triangle: T(n,k) = A001654(nk) for n>=0 and 0<=k<=n.
 A180664 (program): Golden Triangle sums: a(n) = a(n1) + A001654(n+1) with a(0)=0.
 A180665 (program): Golden Triangle sums: a(n)=a(n2)+A001654(n) with a(0)=0 and a(1)=1.
 A180666 (program): Golden Triangle sums: a(n)=a(n4)+A001654(n) with a(0)=0, a(1)=1, a(2)=2 and a(3)=6.
 A180668 (program): a(n) = a(n1)+a(n2)+a(n3)+4*n8 with a(0)=0, a(1)=0 and a(2)=1.
 A180671 (program): a(n) = Fibonacci(n+6)  Fibonacci(6).
 A180672 (program): a(n) = Fibonacci(n+7)  Fibonacci(7).
 A180673 (program): a(n) = Fibonacci(n+8)  Fibonacci(8).
 A180674 (program): a(n) = Fibonacci(n+9)  Fibonacci(9).
 A180677 (program): The Gi4 sums of the PellJacobsthal triangle A013609.
 A180713 (program): If n is even then a(n) = 3n, if n == 1 mod 4 then a(n) = 3n+1, if n == 3 mod 4 then a(n) = 3n+2.
 A180724 (program): a(n) = n^2 + largest prime < n^2.
 A180739 (program): Diagonal of array arising in computing the number of numerical semigroups using generating functions.
 A180845 (program): a(n) = (16^n3^n)/13
 A180846 (program): a(n) = (81^n  2^n)/79.
 A180853 (program): Trajectory of 4 under map n>A006368(n).
 A180857 (program): Wiener index of the Moebius ladder M(n).
 A180861 (program): Wiener index of the npan graph.
 A180863 (program): Wiener index of the nsun graph.
 A180919 (program): a(n) = n^2 + 731*n + 1.
 A180920 (program): Number a(n) of terms in the sum of cube of consecutive integers starting from a(n) such that the sum equals a squared integer.
 A180926 (program): Numbers k such that 6k and 10k are triangular numbers.
 A180955 (program): Numerator in triangle T(n,k)=A180955/A180956 read by rows. A001790(A004736).
 A180956 (program): Denominator in triangle T(n,k)=A180955/A180956 read by rows. A046161(A004736).
 A180964 (program): a(0)=1; for n>0, a(n) = 1 + 3*A117571(n1).
 A181020 (program): Maximum number of 1s in an nX(n+1) binary matrix with no three 1s adjacent in a line along a row, column or diagonally.
 A181021 (program): Maximum number of 1s in an nX(n+2) binary matrix with no three 1s adjacent in a line along a row, column or diagonally.
 A181065 (program): a(n)=(F(n)sumofdigits(F(n)))/9, where F(n) = A000045(n).

A181090 (program): Sum_ d F(n) d^3, where F(n) are the Fibonacci numbers  A181106 (program): Largest odd number strictly less than a square.
 A181118 (program): Sequencing of all rational numbers p/q > 0 as ordered pairs (p,q). The rational (p,q) occurs as the nth ordered pair where n=(p+q1)*(p+q2)/2+q.
 A181120 (program): Partial sums of round(n^2/12) (A069905).
 A181132 (program): a(0)=0; thereafter a(n) = total number of 0’s in binary expansions of 1, …, n.
 A181133 (program): a(n) = n + A003056(n).
 A181134 (program): Sum of 13th powers: a(n) = Sum_ j=0..n j^13.
 A181138 (program): Least positive integer k such that n^2 + k is a cube.
 A181149 (program): a(n) = prime(n)^3 + prime(n)^2 + prime(n).
 A181150 (program): a(n) = prime(n)^3 + prime(n) + 1.
 A181151 (program): a(n) = prime(n)^3 + prime(n)^2 + 1.
 A181155 (program): Odious numbers (A000069) plus one; complement of A026147.
 A181156 (program): Odd Fibonacci numbers F which have a proper Fibonacci divisor G such that F/G is a Lucas number or a product of Lucas numbers.
 A181176 (program): The minimum absolute value obtainable by partitioning the first n consecutive integers into two sets and subtracting the two sums of the sets.
 A181183 (program): a(n) = sigma(tau(n)) (mod 2).
 A181208 (program): Number of n X 4 binary matrices with no two 1’s adjacent diagonally or antidiagonally.
 A181237 (program): Number of (3n) X 3 binary matrices with all row sums equal and all column sums equal.
 A181281 (program): A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,…,n in a circle, increasing clockwise. Starting with i=1, delete the integer 4 places clockwise from i. Repeat, counting 4 places from the next undeleted integer, until only one integer remains.
 A181282 (program): a(n) is the number of associate RotaBaxter words in one idempotent generator x and one idempotent operator P of degree n. Such words are RotaBaxter words that begin and/or ends with x, and P is applied n times in the word.
 A181286 (program): Partial sums of floor(n^2/3) (A000212).
 A181287 (program): Numbers of the form i*5^j1 (i=1..4, j >= 0).
 A181288 (program): Numbers of the form i*6^j1 (i=1..5, j >= 0).
 A181290 (program): The sum of the lengths of the 2compositions of n. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n. The length of the 2composition is the number of columns.
 A181292 (program): The sum of the entries in the top rows of all 2compositions of n. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.
 A181294 (program): Number of 0’s in all 2compositions of n. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.
 A181296 (program): The number of odd entries in all the 2compositions of n.
 A181301 (program): Number of 2compositions of n having no column with equal entries. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.
 A181303 (program): Numbers of the form i*7^j1 (i=1..6, j >= 0).
 A181305 (program): Number of increasing columns in all 2compositions of n. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.
 A181306 (program): Number of 2compositions of n having no increasing columns. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.
 A181318 (program): a(n) = A060819(n)^2.
 A181331 (program): Number of 0’s in the top rows of all 2compositions of n.
 A181357 (program): Sum of squares of digits of Fibonacci(n).
 A181358 (program): Number of twiddle factors in the first stage of a Pease Radix 4 Fast Fourier Transform.
 A181363 (program): 1 followed by the primes, interleaved recursively.
 A181367 (program): Number of 2compositions of n containing at least one 0 entry. A 2composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.
 A181385 (program): Maximal number that can be obtained by reversing n in an integer base.
 A181388 (program): a(n) = Sum_ k=1..n 2^T(k1), where T = A000217 are the triangular numbers 0, 1, 3, 6, 10, … . For n=0 we have the empty sum equal to 0.
 A181389 (program): Absolute difference between (sum of previous terms) and (ntheven square) with a(1) = 2.
 A181390 (program): Absolute difference between (sum of previous terms) and (nthodd square) with a(1) = 1.
 A181402 (program): Total number of positive integers below 10^n requiring 7 positive cubes in their representation as sum of cubes.
 A181404 (program): Total number of positive integers below 10^n requiring 8 positive cubes in their representation as sum of cubes.
 A181405 (program): Total number of ndigit numbers requiring 8 positive cubes in their representation as sum of cubes.
 A181406 (program): Symbolic sequence at the accumulation point of the 3*2^ k supercycles of unimodal maps.
 A181407 (program): a(n) = (n4)(n3)2^(n2).
 A181427 (program): n+[n^2 if n is odd or n^3 if n is even].
 A181433 (program): Numbers k such that 11*k is 5 less than a square.
 A181434 (program): First column in matrix inverse of a mixed convolution of A052542.
 A181435 (program): First column in matrix inverse of a mixed convolution of A052906.
 A181440 (program): a(1) = 2; for n > 1, a(n) = A000217(n)(sum of previous terms).
 A181475 (program): a(n) = 3n^4 + 6n^3  3*n + 1.
 A181497 (program): a(n) is the smallest m such that A056753(m) = 2*n + 1.
 A181509 (program): a(1) = 2, a(n) = (ntheven n^3)  (sum of previous terms)
 A181510 (program): Number of permutations of the multiset 1,1,2,2,3,3,…,n+1,n+1 avoiding the permutation patterns 132, 231, 2134
 A181527 (program): Binomial transform of A113127; (1, 1, 3, 7, 15, 31,…) convolved with (1, 3, 7, 15, 31, 63,…).
 A181532 (program): a(0) = 0, a(1) = 1, a(2) = 1; a(n) = a(n1) + a(n2) + a(n4)
 A181534 (program): Minimum number of rounds to be played to decide a twoplayer game of up to n rounds in which the winner of round j receives j points.
 A181543 (program): Triangle of cubed binomial coefficients, T(n,k) = C(n,k)^3, read by rows.
 A181565 (program): a(n) = 3*2^n + 1.
 A181566 (program): Expected number of elements needed to identify an abelian group of order n by testing the order of random elements.
 A181569 (program): Greatest common divisor of n! and n+1.
 A181586 (program): a(0)=0; a(n+1) = 2*a(n) + period 4:repeat 0,1,2,1.
 A181617 (program): Molecular topological indices of the complete graph K_n.
 A181639 (program): Numbers n such that omega(n) = digitreverse(n).
 A181640 (program): Partial sums of floor(n^2/5) (A118015).
 A181653 (program): Generalized (conditional) Riordan array with kth column generated by x^k(1+x) if k mod 2 = 0, x^k(1+x+x^2) otherwise.
 A181655 (program): Expansion of (1+2xx^3+x^4)/(14x^2+3x^4).
 A181658 (program): Row sums of A181657.
 A181668 (program): Period 12: repeat [5,5,5,2,2,2,8,8,8,2,2,2].
 A181679 (program): a(n) = 121n^2 + 2n.
 A181709 (program): Indices of primes in A007310.
 A181716 (program): a(n) = a(n1) + a(n2) + (1)^n, with a(0)=0 and a(1)=1.
 A181718 (program): a(n) = (1/9)(10^(2n) + 10^n  2).
 A181719 (program): a(n) = A133473(n+1)^2.
 A181736 (program): The number of integers in base 2n such that all digits are used exactly once (so length is 2n) and for each m<=2n the base 2n integer consisting of the first m digits is divisible by m.
 A181762 (program): a(n) = n/2 if n is even, otherwise 3n+5.
 A181763 (program): a(n) = A061037(n)^2.
 A181773 (program): Molecular topological indices of the cocktail party graphs.
 A181797 (program): a(n) = n multiplied by the sum of its squarefree divisors (A048250(n)).
 A181829 (program): a(n) = 4A060819(n2)A060819(n+2).
 A181861 (program): a(n) = gcd(n^2, n!/floor(n/2)!^2).
 A181888 (program): Second column of triangle in A182971.
 A181889 (program): Bisection of A181888.
 A181890 (program): a(n) = 8n^2 + 14n + 5.
 A181892 (program): (n!/41)^2.
 A181900 (program): a(n) = A022998(n) * n.
 A181923 (program): Nonprimes (A018252) mod 2.
 A181940 (program): a(0)=0, and there are a(n) terms between a(n) and the nearest a(n)+1.
 A181963 (program): Primegenerating polynomial: 25n^2  1185n + 14083.
 A181965 (program): a(n) = 10^(2n+1)  10^n  1.
 A181968 (program): 54n^3  1.
 A181969 (program): Primegenerating polynomial: 16n^2  292n + 1373.
 A181972 (program): Number of integer pairs (x,y) such that 0<x<y<=n and x*y<=floor(n/2).
 A181973 (program): Primegenerating polynomial: 16n^2  300n + 1447.
 A181975 (program): The sequence 1, 2, 3, 4, 5, 4, 3, 2 repeated.
 A181983 (program): a(n) = (1)^(n+1) * n.
 A181984 (program): INVERT transform of A028310.
 A181995 (program): a(n) = if n mod 2 = 1 then n*(n  1) else (n  1)^2 + (n  2)/2.
 A182027 (program): a(n) = number of nlettered words in the alphabet 1, 2 with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 2].
 A182047 (program): Smallest prime > n*(n+1).
 A182058 (program): Number of moves needed to solve the Towers of Hanoi puzzle with 6 pegs and n disks.
 A182067 (program): a(n) = floor(n)  floor(n/2)  floor(n/3)  floor(n/5) + floor(n/30).
 A182079 (program): a(n) = floor(n*floor((n1)/2)/3).
 A182082 (program): Number of pairs, (x,y), with x >= y, whose LCM does not exceed n.
 A182084 (program): 3*n  n/p, where p is the smallest prime dividing n.
 A182097 (program): Expansion of 1/(1x^2x^3).
 A182105 (program): Number of elements merged by bottomup merge sort.
 A182112 (program): Number of ordered triples (w,x,y) with all terms in n,…,0,…,n and (w+n)^2=x+y+w.
 A182143 (program): Number of independent vertex sets in the Moebius ladder graph with 2n nodes (n >= 0).
 A182174 (program): a(n) = prime(n)^2  n.
 A182188 (program): A sequence of row differences for table A182119.
 A182189 (program): a(n) = 6*a(n1)  a(n2)  4 with n > 1, a(0)=1, a(1)=3.
 A182190 (program): a(n) = 6*a(n1)  a(n2) + 4 with n > 1, a(0)=0, a(1)=4.
 A182191 (program): a(n) = 6*a(n1)  a(n2) + 12 with n>1, a(0)=1, a(1)=5.
 A182193 (program): Sequence of row differences related to table A182355.
 A182200 (program): a(n) = prime(n)^23.
 A182214 (program): Bondage number of the Cartesian product graph G = C_n X K_2.
 A182215 (program): Bondage number of the Cartesian product graph G = C_n X C_3.
 A182220 (program): Largest number k such that there exists an extensional acyclic digraph on n labeled nodes with k sources.
 A182230 (program): a(n) = a(n1)+floor(a(n2)/4) with a(0)=3, a(1)=4.
 A182241 (program): a(n) = A161151(2*n)/2
 A182255 (program): 81n^2  2247n + 15383.
 A182258 (program): Least number k such that there exist a simple graph on k vertices having precisely n spanning trees.
 A182260 (program): Number of ordered triples (w,x,y) with all terms in 1,…,n and 2w<x+y.
 A182268 (program): Denominator of Euler(n, 3/14).
 A182305 (program): a(n+1) = a(n) + floor(a(n)/4) with a(0)=4.
 A182306 (program): a(n+1) = a(n) + floor(a(n)/5) with a(0)=5.
 A182307 (program): a(n+1) = a(n) + floor(a(n)/6) with a(0)=6.
 A182308 (program): a(n+1) = a(n) + floor(a(n)/7) with a(0)=7
 A182321 (program): Number of iterations of A025581(n) required to reach 0.
 A182323 (program): a(n) = (194n + 3(1)^n + 1)/4 + 24.
 A182324 (program): n + (initial digit of n) in decimal representation.
 A182361 (program): a(n+1) = a(n) + floor(a(n)/8) with a(0)=8.
 A182362 (program): a(n+1) = a(n) + floor(a(n)/9) with a(0)=9.
 A182363 (program): a(n+1) = a(n) + floor(a(n)/10) with a(0)=10.
 A182386 (program): a(0) = 1, a(n) = 1  n * a(n1).
 A182409 (program): Primegenerating polynomial: 4n^2 + 12n  1583.
 A182415 (program): a(0) = 1, a(1) = 2; for n>1, a(n) = a(n1) + a(n2) + 4.
 A182428 (program): a(n) = 2n(19n).
 A182432 (program): Recurrence a(n)a(n2) = a(n1)(a(n1)+3) with a(0) = 1, a(1) = 4.
 A182435 (program): a(n) = 6*a(n1)  a(n2)  2 with n>1, a(0)=0, a(1)=1.
 A182453 (program): a(n) = 3^n  n*(n1)/2.
 A182455 (program): a(0)=1, a(n) = (a(n1) mod (n+2))*(n+2).
 A182460 (program): a(n) = (3/5)*2^(4n+1)  (1/5).
 A182461 (program): a(n) = 3a(n1)  2a(n2) with a(0)=16 and a(1)=40.
 A182462 (program): a(n) = 3a(n1)  2a(n2) with a(0)=20 and a(1)=50.
 A182464 (program): a(n) = 3a(n1)  2a(n2) with a(0)=24 and a(1)=60.
 A182465 (program): a(n) = 3a(n1)  2a(n2) with a(0)=28 and a(1)=70.
 A182466 (program): a(n) = 3a(n1)  2a(n2) with a(0)=32 and a(1)=80.
 A182467 (program): a(n) = 3a(n1)  2a(n2) with a(0)=36 and a(1)=90.
 A182480 (program): Decimal expansion of 16000000/63.
 A182512 (program): a(n) = (16^n  1)/5.
 A182522 (program): a(0) = 1; thereafter a(2n + 1) = 3^n, a(2n + 2) = 2 * 3^n.
 A182531 (program): Extremal graph numbers for a triangle with an edge off it.
 A182535 (program): Number of terms in Zeckendorf representation of prime(n).
 A182568 (program): a(n) = 2floor(n/4)(n  2*(1 + floor(n/4))).
 A182576 (program): Number of 1’s in the Zeckendorf representation of n^2.
 A182577 (program): Number of ones in Zeckendorf representation of n!
 A182578 (program): Number of ones in Zeckendorf representation of n^n.
 A182581 (program): (3adic valuation of n), read mod 2.
 A182582 (program): a(n) = (A096268(n) + A182581(n)) mod 2.
 A182617 (program): Number of toothpicks in a toothpick spiral around n cells on hexagonal net.
 A182618 (program): Number of new grid points that are covered by the toothpicks added at nthstage to the toothpick spiral of A182617.
 A182619 (program): Number of vertices that are connected to two edges in a spiral without holes constructed with n hexagons.
 A182627 (program): Total number of digits in binary expansion of all divisors of n.
 A182660 (program): a(2^(k+1)) = k; 0 everywhere else.
 A182664 (program): a(n) = A088828(n) + A157502(n).
 A182687 (program): a(n) = the smallest 1digit number with exactly n divisors, a(n) = 0 if no such number exists.
 A182688 (program): a(n) = the largest 1digit number with exactly n divisors, a(n) = 0 if no such number exists.
 A182741 (program): A shell model of partitions as a binary code.
 A182751 (program): a(1)=1, a(2)=3, a(3)=6; a(n) = 3*a(n2) for n > 3.
 A182757 (program): Numbers k > 1 such that is no sequence B of type: b(1) = 1, b(2) = k, for n >= 3; b(n) = the smallest number h > b(n1) such that [[b(n2) + b(n1)] * [b(n2) + h] * [b(n1) + h]] / [b(n2) * b(n1) * h] is integer .
 A182761 (program): Beatty sequence for (7  sqrt(5))/2.
 A182765 (program): Beatty sequence for (6 + sqrt(2))/4.
 A182766 (program): Beatty sequence for 5  2*sqrt(2).
 A182767 (program): Beatty sequence for 1+e^2.
 A182768 (program): Beatty sequence for 1+e^(2).
 A182769 (program): Beatty sequence for (4 + sqrt(2))/2.
 A182770 (program): Beatty sequence for 3sqrt(2).
 A182771 (program): Beatty sequence for (6+sqrt(3))/3.
 A182772 (program): Beatty sequence for (5sqrt(3))/2.
 A182773 (program): Beatty sequence for 1+2^(2/3).
 A182777 (program): Beatty sequence for 3sqrt(3).
 A182778 (program): Beatty sequence for 3 + sqrt(3).
 A182780 (program): Twice A024537.
 A182788 (program): Number of ncolorings of the Triangle Graph of order 3.
 A182814 (program): Main diagonal of table A182630.
 A182815 (program): The third row of table A182630.
 A182834 (program): Complement of A007590, except for initial zeros.
 A182835 (program): n+floor(sqrt(2n+3)), complement of A179207.
 A182868 (program): a(n) = 1 + n + 4*n^2.
 A182878 (program): Triangle read by rows: T(n,k) is the number of lattice paths L_n of weight n having length k (0 <= k <= n). These are paths that start at (0,0) and end on the horizontal axis and whose steps are of the following four kinds: a (1,0)step with weight 1, a (1,0)step with weight 2, a (1,1)step with weight 2, and a (1,1)step with weight 1.
 A182890 (program): Number of (1,0)steps of weight 1 at level 0 in all weighted lattice paths in L_n.
 A182895 (program): Number of (1,0)steps at level 0 in all weighted lattice paths in L_n.
 A182936 (program): Greatest common divisor of the proper divisors of n, 0 if there are none.
 A182942 (program): Ranks of primes when all odd prime powers p^j, for j>=1, are jointly ranked.
 A182986 (program): Zero together with the prime numbers (A000040).
 A183002 (program): Partial sums of A161840.
 A183003 (program): A183002(n)/2.
 A183010 (program): a(n) = 24*n  1.
 A183033 (program): Minute with hour hand overlap problem on analog clock. Fractions of seconds.
 A183037 (program): a(n) = A001511(n)*2^A001511(n) where A001511(n) equals the 2adic valuation of 2n.
 A183039 (program): a(n) = A051064(n)*3^A051064(n) where A051064(n) equals the 3adic valuation of 3n.
 A183041 (program): Least number of knight’s moves from (0,0) to (n,1) on infinite chessboard.
 A183060 (program): Number of “ON” cells at nth stage in a simple 2dimensional cellular automaton (see Comments for precise definition).
 A183061 (program): First differences of A183060.
 A183063 (program): Number of even divisors of n.
 A183066 (program): G.f.: A(x) = (1 + 21x + 3x^2  x^3)/(1x)^5.
 A183094 (program): a(n) = number of powerful divisors d (excluding 1) of n.
 A183110 (program): Periodlength of the ultimate periodic behavior of the orbit of a list [1,1,1,…,1] of n 1’s under the mapping defined in the comments.
 A183119 (program): Magnetic Tower of Hanoi, total number of moves generated by a certain algorithm, yielding a “forward moving” nonoptimal solution of the [RED ; NEUTRAL ; BLUE] precolored puzzle.
 A183136 (program): a(n) = [1/r]+[2/r]+…+[n/r], where r = golden ratio = (1+sqrt(5))/2 and []=floor.
 A183137 (program): [1/s]+[2/s]+…+[n/s], where s=(golden ratio)^2 and []=floor.
 A183138 (program): a(n) = floor(n/(2+sqrt(2))).
 A183139 (program): a(n) = [1/r]+[2/r]+…+[n/r], where r=sqrt(2) and []=floor.
 A183140 (program): a(n) = [1/s]+[2/s]+…+[n/s], where s=2+sqrt(2) and []=floor.
 A183142 (program): Beatty sequence for 2/(3+sqrt(3)).
 A183143 (program): [1/r]+[2/r]+…+[n/r], where r=sqrt(3) and []=floor.
 A183144 (program): [1/s]+[2/s]+…+[n/s], where s=(3+sqrt(3))/2, []=floor.
 A183155 (program): The number of orderpreserving partial isometries (of an nchain) of fix zero (fix of alpha = 0). Equivalently, the number of orderpreserving partial derangement isometries (of an nchain).
 A183156 (program): The number T(n) of isometries of all subspaces of the finite metric space 1,2,…,n (as a subspace of the reals with the Euclidean metric).
 A183199 (program): Least integer k such that Floor(kf(n+1)>kf(n), where f(n)=(n^2)/(1+n^2).
 A183207 (program): Termwise products of the natural numbers and odd integers repeated
 A183208 (program): Iterates of f(x)=floor((3x1)/2) from x=6.
 A183217 (program): Complement of the pentagonal numbers.
 A183218 (program): Complement of the hexagonal numbers.
 A183219 (program): Complement of the heptagonal (7gonal) numbers.
 A183220 (program): Complement of the octagonal numbers.
 A183221 (program): Complement of the 9gonal numbers.
 A183222 (program): Complement of the 10gonal numbers.
 A183223 (program): Complement of the 11gonal numbers.
 A183224 (program): Complement of the 12gonal numbers.
 A183226 (program): Sum of digits of (2^n) in base 5, also sum of digits of (10^n) in base 5.
 A183228 (program): a(n) is the base5 digit sum of 10^n+1.
 A183264 (program): Number of singly defective permutations of 1..n with exactly 1 maximum.
 A183292 (program): Complement of A055999.
 A183293 (program): Complement of A056000.
 A183294 (program): Complement of A005449.
 A183295 (program): Complement of A115067.
 A183296 (program): Complement of A005476.
 A183297 (program): Complement of A005475.
 A183298 (program): Complement of A147875.
 A183299 (program): Complement of A005563.
 A183300 (program): Positive integers not of the form 2n^2.
 A183301 (program): Complement of A014105.
 A183302 (program): Complement of A014106.
 A183345 (program): Number of n X 3 binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally.
 A183354 (program): One quarter the number of nX2 1..4 arrays with no two neighbors of any element equal to each other
 A183355 (program): One quarter the number of nX3 1..4 arrays with no two neighbors of any element equal to each other
 A183356 (program): One quarter the number of n X 4 1..4 arrays with no two neighbors of any element equal to each other.
 A183409 (program): Number of n X 2 binary arrays with each sum of a(1..i,1..j) no greater than i*j/2 and rows and columns in nondecreasing order.
 A183425 (program): Half the number of n X 2 0..2 arrays with no element equal its row sum plus its column sum mod 3.
 A183430 (program): One third the number of n X 2 0..3 arrays with no element equal to its row sum plus its column sum mod 4.
 A183544 (program): Ordering of the numbers in the tree A183542; complement of A183545.
 A183545 (program): Ordering of the numbers in the tree A183543; complement of A183544.
 A183569 (program): n+floor(sqrt(4n3)), complement of A024206.
 A183570 (program): a(n) = n + floor(sqrt(n + 1)).
 A183571 (program): n+floor(sqrt(n+2)).
 A183572 (program): a(n) = n + floor(sqrt(2*n1)).
 A183573 (program): a(n) = n + floor(sqrt(2n+1)).
 A183574 (program): n+Floor[sqrt(2n+2)].
 A183575 (program): a(n) = n  1 + ceiling((n^22)/2); complement of A183574.
 A183624 (program): Number of (n+1) X 2 0..2 arrays with every 2 x 2 subblock summing to 4.
 A183625 (program): Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock summing to 4.
 A183627 (program): Number of (n+1) X 5 0..2 arrays with every 2 x 2 subblock summing to 4.
 A183682 (program): Number of (n+1) X 3 binary arrays with every 2 X 2 subblock nonsingular.
 A183774 (program): Half the number of (n+1)X2 binary arrays with no 2X2 subblock having exactly 2 ones
 A183855 (program): n+floor(sqrt(3n3)); complement of A128422.
 A183856 (program): n+floor(sqrt(3n2)); complement of A143975.
 A183857 (program): a(n) = n  1 + ceiling((2/3)*n^2); complement of A183874.
 A183858 (program): a(n) = n + floor(sqrt(3n)).
 A183859 (program): a(n) = n  1 + ceiling((n^2)/3); complement of A183858.
 A183860 (program): n+floor(sqrt(3n+1)); complement of A183861.
 A183861 (program): n1+ceiling((1+n^2)/3); complement of A183860.
 A183862 (program): n+floor(sqrt(5n/2)); complement of A183863.
 A183863 (program): n1+ceiling((2/5)(1/2+n^2)); complement of A183862.
 A183864 (program): n+floor(sqrt(5*n/3)); complement of A183865.
 A183865 (program): n1+ceiling(3(n+2)/5); complement of A183864.
 A183866 (program): n+floor(2*sqrt(n1)); complement of A035106.
 A183867 (program): a(n) = n + floor(2*sqrt(n)); complement of A184676.
 A183868 (program): a(n) = n + floor(2*sqrt(n+1)); complement of A079524.
 A183869 (program): n+floor(sqrt(4n+5)); complement of A004116.
 A183870 (program): n+floor(sqrt(5n5)); complement of A183871.
 A183871 (program): a(n) = n + ceiling( (1/5)*n^2 ). Complement of A183870.
 A183872 (program): n+floor(sqrt(5n)); complement of A183873.
 A183873 (program): n1+ceiling((1/5)n^2); complement of A183872.
 A183874 (program): a(n) = n + floor(sqrt(3*n/2)). Complement of A183857.
 A183895 (program): Real part of a (4,4) Gaussian integer Somos4 sequence.
 A183896 (program): Imaginary part of a (4,4) Gaussian integer Somos4 sequence.
 A183897 (program): Number of nondecreasing arrangements of n+3 numbers in 0..2 with each number being the sum mod 3 of three others.
 A183898 (program): Number of nondecreasing arrangements of n+3 numbers in 0..3 with each number being the sum mod 4 of three others.
 A183905 (program): Number of nondecreasing arrangements of n+2 numbers in 0..2 with each number being the sum mod 3 of two others.
 A183906 (program): Number of nondecreasing arrangements of n+2 numbers in 0..3 with each number being the sum mod 4 of two others.
 A183907 (program): Number of nondecreasing arrangements of n+2 numbers in 0..4 with each number being the sum mod 5 of two others.
 A183918 (program): Characteristic sequence for cos(2Pi/n) being rational.
 A183919 (program): Characteristic sequence for sin(2Pi/n) being rational.
 A183977 (program): 1/4 the number of (n+1)X(n+1) binary arrays with all 2X2 subblock sums the same
 A183978 (program): 1/4 the number of (n+1) X 2 binary arrays with all 2 X 2 subblock sums the same.
 A183979 (program): 1/4 the number of (n+1) X 3 binary arrays with all 2 X 2 subblock sums the same.
 A183980 (program): 1/4 the number of (n+1) X 4 binary arrays with all 2 X 2 subblock sums the same.
 A183981 (program): 1/4 the number of (n+1) X 5 binary arrays with all 2 X 2 subblock sums the same.
 A183982 (program): 1/4 the number of (n+1) X 6 binary arrays with all 2 X 2 subblock sums the same.
 A183983 (program): 1/4 the number of (n+1) X 7 binary arrays with all 2 X 2 subblock sums the same.
 A183984 (program): 1/4 the number of (n+1) X 8 binary arrays with all 2 X 2 subblock sums the same.
 A183985 (program): 1/4 the number of (n+1) X 9 binary arrays with all 2 X 2 subblock sums the same.
 A184004 (program): a(n) = n + floor(sqrt(4n/3)); complement of A184005.
 A184005 (program): a(n) = n  1 + ceiling(3*n^2/4); complement of A184004.
 A184006 (program): floor(nr+h), where r=sqrt(3), h=1/3; complement of A184007.
 A184007 (program): floor(ns+hhs), where s=(3+sqrt(3))/2, h=1/3. Complement of A184006.
 A184009 (program): n1+ceiling((3/4)n^2); complement of A184008.
 A184010 (program): n + floor(sqrt(1+4n/3)); complement of A001859 (except for initial zero).
 A184012 (program): n + floor(sqrt(5n4)); complement of A184013.
 A184013 (program): n  1 + ceiling((4+n^2)/5); complement of A184012.
 A184016 (program): n+floor(3*sqrt(n)); complement of A184017.
 A184017 (program): n1+ceiling((n/3)^2); complement of A184016.
 A184030 (program): 1/16 the number of (n+1)X(n+1) 0..3 arrays with all 2X2 subblocks having the same four values
 A184031 (program): 1/16 the number of (n+1) X 2 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184032 (program): 1/16 the number of (n+1) X 3 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184033 (program): 1/16 the number of (n+1) X 4 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184034 (program): 1/16 the number of (n+1) X 5 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184035 (program): 1/16 the number of (n+1) X 6 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184036 (program): 1/16 the number of (n+1) X 7 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184037 (program): 1/16 the number of (n+1) X 8 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184038 (program): 1/16 the number of (n+1) X 9 0..3 arrays with all 2 X 2 subblocks having the same four values.
 A184040 (program): 1/9 the number of (n+1)X(n+1) 0..2 arrays with all 2X2 subblocks having the same four values
 A184041 (program): 1/9 the number of (n+1) X 3 0..2 arrays with all 2 X 2 subblocks having the same four values.
 A184042 (program): 1/9 the number of (n+1) X 4 0..2 arrays with all 2 X 2 subblocks having the same four values.
 A184043 (program): 1/9 the number of (n+1) X 5 0..2 arrays with all 2 X 2 subblocks having the same four values.
 A184044 (program): 1/9 the number of (n+1) X 6 0..2 arrays with all 2 X 2 subblocks having the same four values.
 A184045 (program): 1/9 the number of (n+1) X 7 0..2 arrays with all 2 X 2 subblocks having the same four values.
 A184046 (program): 1/9 the number of (n+1) X 8 0..2 arrays with all 2 X 2 subblocks having the same four values.
 A184047 (program): 1/9 the number of (n+1) X 9 0..2 arrays with all 2 X 2 subblocks having the same four values.

A184049 (program): T(n,k) is the number of orderpreserving and orderdecreasing partial isometries (of an nchain) of height k (height of alpha = Im(alpha) ).  A184063 (program): Number of (n+1) X 2 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.
 A184102 (program): n+floor(4*sqrt(n)); complement of A184103.
 A184103 (program): n1+ceiling(n^2/4); complement of A184102.
 A184104 (program): n+floor(5*sqrt(n)); complement of A184105.
 A184105 (program): n1+ceiling((n/5)^2); complement of A184104.
 A184107 (program): n1+ceiling((n/6)^2); complement of A184106.
 A184108 (program): n + floor(3*sqrt(n1)); complement of A184109.
 A184109 (program): n + ceiling(n^2/9); complement of A184108.
 A184110 (program): n + floor(3*sqrt(n+1)).
 A184111 (program): n+floor(4*sqrt(n1)); complement of A184112.
 A184112 (program): n+ceiling(n^2/16); complement of A184111.
 A184113 (program): n + floor(4*sqrt(n+1)).
 A184114 (program): n + floor(5*sqrt(n1)); complement of A184115.
 A184115 (program): n + ceiling(n^2/25); complement of A184114.
 A184116 (program): a(n) = n + floor(5*sqrt(n + 1)).
 A184117 (program): Lower sWythoff sequence, where s(n) = 2n + 1.
 A184118 (program): Upper s(n)Wythoff sequence, where s(n) = 2n + 1.
 A184119 (program): Upper s(n)Wythoff sequence, where s(n) = 2n  1; complement of A136119.
 A184218 (program): a(n) = largest k such that A000217(n+1) = A000217(n) + (A000217(n) mod k), or 0 if no such k exists.
 A184220 (program): a(n) = largest k such that A000290(n+1) = A000290(n) + (A000290(n) mod k), or 0 if no such k exists.
 A184327 (program): a(1)=1, a(2)=17; thereafter a(n) = 6*a(n1)a(n2)+c, where c=4 if n is odd, c=12 if n is even.
 A184334 (program): Period 6 sequence [0, 2, 2, 0, 2, 2, …] except a(0) = 1.
 A184336 (program): a(n) = n + floor((3*n)^(1/3)  2/3).
 A184337 (program): a(n) is the integer whose decimal representation consists of n 8’s followed by n 1’s.
 A184358 (program): a(n) = (n+1)!^2/2^n.
 A184387 (program): a(n) = sum of numbers from 1 to sigma(n), where sigma(n) = A000203(n).
 A184388 (program): a(n) = product of numbers from 1 to sigma(n), where sigma(n) = A000203(n).
 A184389 (program): a(n) = Sum_ k=1..tau(n) k, where tau is the number of divisors of n (A000005).
 A184390 (program): a(n) = sum of numbers from 1 to pi(n), where pi(n) = A007955(n).
 A184418 (program): Convolution square of A040001.
 A184423 (program): a(n) = (2n)!(3*n)!/n!^5.
 A184427 (program): Lower sWythoff sequence of A000290 (the squares). Complement of A184428.
 A184428 (program): Upper sWythoff sequence of A000290 (the squares). Complement of A184427.
 A184478 (program): Lower sWythoff sequence, where s(n) = 3n + 1. Complement of A184479.
 A184480 (program): Lower sWythoff sequence, where s(n)=3n. Complement of A001956.
 A184482 (program): Lower sWythoff sequence, where s(n)=3n1. Complement of A184483.
 A184483 (program): Upper sWythoff sequence, where s(n)=3n1. Complement of A184482.
 A184484 (program): Lower sWythoff sequence, where s(n)=3n2. Complement of A184485.
 A184485 (program): Upper sWythoff sequence, where s(n)=3n2. Complement of A184484.
 A184486 (program): Lower sWythoff sequence, where s(n)=4n+1. Complement of A184487.
 A184487 (program): Upper sWythoff sequence, where s(n)=4n+1. Complement of A184486.
 A184514 (program): Lower sWythoff sequence, where s(n)=4n1. Complement of A184515.
 A184515 (program): Upper sWythoff sequence, where s=4n1. Complement of A184514.
 A184516 (program): Lower sWythoff sequence, where s=4n2. Complement of A184517.
 A184517 (program): Upper sWythoff sequence, where s=4n2. Complement of A184516.
 A184518 (program): Lower sWythoff sequence, where s=4n3. Complement of A184519.
 A184519 (program): Upper sWythoff sequence, where s=4n3. Complement of A184518.
 A184522 (program): Upper sWythoff sequence, where s=5n. Complement of A184523.
 A184523 (program): Upper sWythoff sequence, where s=5n. Complement of A184522.
 A184524 (program): Lower sWythoff sequence, where s=5n1. Complement of A184525.
 A184525 (program): Upper sWythoff sequence, where s=5n1. Complement of A184524.
 A184527 (program): Upper sWythoff sequence, where s=5n2. Complement of A184526.
 A184528 (program): Lower sWythoff sequence, where s=5n3. Complement of A184529.
 A184529 (program): Upper sWythoff sequence, where s=5n3. Complement of A184528.
 A184530 (program): Lower sWythoff sequence, where s=5n4. Complement of A184531.
 A184531 (program): Upper sWythoff sequence, where s=5n4. Complement of A184530.
 A184533 (program): a(n) = floor(1/ (2+n^3)^(1/3) ), where =fractional part.
 A184534 (program): a(n) = floor(1/ (4+n^3)^(1/3) ), where =fractional part.
 A184535 (program): a(n) = floor(3/5 * n^2), with a(1)=1.
 A184536 (program): a(n) = floor(1/ (1+n^4)^(1/4) ), where = fractional part.
 A184537 (program): a(n) = floor(1/ (2+n^4)^(1/4) ), where = fractional part.
 A184538 (program): Floor[1/ (3+n^4)^(1/4) ], where =fractional part.
 A184540 (program): Number of (n+2) X 3 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.
 A184541 (program): Number of (n+2) X 4 binary arrays with each 3 X 3 subblock having rows and columns in lexicographically nondecreasing order.
 A184549 (program): Superbirthdays (falling on the same weekday), version 1 (birth within the year following a February 29).
 A184550 (program): Superbirthdays (falling on the same weekday), version 2 (birth within 1 and 2 years after a February 29).
 A184551 (program): Superbirthdays (falling on the same weekday), version 3 (birth within 2 and 3 years after a February 29).
 A184552 (program): Superbirthdays (falling on the same weekday), version 4 (birth in the year preceding a February 29).
 A184580 (program): a(n) = floor((n1/4)*sqrt(2)), complement of A184581.
 A184581 (program): a(n) = floor((n + 1/4)*(2 + sqrt(2))).
 A184582 (program): floor[(n+1/5)r] where r=(1+sqrt(5))/2; complement of A184583.
 A184583 (program): floor[(n1/5)(1+r)], where r=(1+sqrt(5))/2; complement of A184582.
 A184584 (program): floor[(n1/3)r], where r=sqrt(5); complement of A184585.
 A184586 (program): a(n) = floor((n1/2)*r), where r=sqrt(5); complement of A184587.
 A184591 (program): a(n) = floor(n*(Pi1)1); complement of A184592.
 A184592 (program): a(n) = floor((n*(Pi1) + 1)/(Pi2)); complement of A184591.
 A184593 (program): 5n  A101306: sum_ i=1..n the last digit of prime(i).
 A184615 (program): Positive parts of the nonadjacent forms for n
 A184616 (program): Negated negative parts of the nonadjacent forms
 A184617 (program): With nonadjacent forms: A184615(n) + A184616(n).
 A184619 (program): a(n) = floor((nh)*s+h), where s=2+sqrt(2) and h=1/3; complement of A184618.
 A184620 (program): a(n) = floor(nr+h), where r=sqrt(2), h=1/4; complement of A184621.
 A184621 (program): a(n) = floor((nh)*s+h), where s=2+sqrt(2) and h=1/4; complement of A184620.
 A184622 (program): a(n) = floor(n*r+h), where r=sqrt(2), h=1/3; complement of A184623.
 A184624 (program): a(n) = floor(n*r +h), where r=sqrt(2), h=1/4; complement of A184619.
 A184626 (program): floor(nr+h), where r=sqrt(3), h=1/4; complement of A184627.
 A184627 (program): floor((nh)*s+h), where s=(3+sqrt(3))/2 and h=1/4; complement of A184626.
 A184628 (program): Floor(1/frac((4+n^4)^(1/4))), where frac(x) is the fractional part of x.
 A184632 (program): Floor(1/ (8+n^4)^(1/4) ), where =fractional part.
 A184634 (program): a(n) = floor(1/ (10+n^4)^(1/4) ), where =fractional part.
 A184635 (program): a(n) = floor(1/ (n+n^4)^(1/4) ), where = fractional part.
 A184636 (program): floor(1/ (n^4+2*n)^(1/4) ), where =fractional part.
 A184637 (program): a(n) = floor(1/ (n^4+3*n)^(1/4) ), where =fractional part.
 A184638 (program): floor(nr+h), where r=sqrt(3), h=1/2; complement of A184653.
 A184653 (program): floor(ns+hhs), where s=(3+sqrt(3))/2, h=1/2; complement of A184638.
 A184654 (program): floor(n*sqrt(3)2/3); complement of A184655.
 A184655 (program): floor(ns+hhs), where s=(3+sqrt(3))/2, h=2/3; complement of A184654.
 A184656 (program): floor(nr+h), where r=(1+sqrt(5))/2, h=1/2; complement of A184657.
 A184657 (program): floor(ns+hhs), where s=(3+sqrt(5))/2, h=1/2; complement of A184656.
 A184658 (program): floor(nr+h), where r=(1+sqrt(5))/2, h=1/3; complement of A184659.
 A184659 (program): floor(ns+hhs), where s=(3+sqrt(5))/2, h=1/3; complement of A184658.
 A184674 (program): a(n) = n+floor((n/21/(2*n))^2); complement of A184675.
 A184675 (program): n + floor(sqrt(n) + sqrt(n+1)); complement of A184674.
 A184676 (program): a(n) = n + floor((n/21/(4*n))^2); complement of A183867.
 A184726 (program): a(n) = A005408(n1)/A090368(n1) for n > 2 and a(n) = 0 for n <= 2.
 A184727 (program): a(n) = A005843(n1)/A090369(n1) for n > 2 and a(n) = 0 for n <= 2.
 A184732 (program): floor(nr+h), where r=(1+sqrt(5))/2, h=1/4; complement of A184733.
 A184733 (program): floor(ns+hhs), where s=(3+sqrt(5))/2, h=1/4; complement of A184732.
 A184734 (program): a(n)=floor(nr+h), where r=(1+sqrt(5))/2, h=1/3; complement of A184735.
 A184735 (program): a(n)=floor(ns+hhs), where s=(3+sqrt(5))/2, h=1/3; complement of A184734.
 A184736 (program): floor(nr+h), where r=1+2^(3/2), h=1/2; complement of A184735.
 A184737 (program): floor(ns+hhs), where s=1+2^(3/2), h=1/2; complement of A184736.
 A184738 (program): floor(nr+h), where r=1+sqrt(5), h=1/2; complement of A184735.
 A184739 (program): floor(ns+hhs), where s=3+sqrt(5), h=1/2; complement of A184738.
 A184740 (program): floor(n*(e1)1/2); complement of A184741.
 A184741 (program): floor(ns+hhs), where s=(e1)/(e2) and h=1/2; complement of A184740.
 A184744 (program): floor(nr+h), where r=1+1/e, h=1/2; complement of A184745.
 A184747 (program): floor(ns+hhs), where s=1+sqrt(5), h=1/2; complement of A184746.
 A184748 (program): floor(nr+h), where r=45^(1/2), h=1/2; complement of A184749.
 A184749 (program): floor(ns+hhs), where s=(7+sqrt(5))/4, h=1/2; complement of A184748.
 A184750 (program): a(n) = largest k such that A000326(n+1) = A000326(n) + (A000326(n) mod k), or 0 if no such k exists.
 A184808 (program): n + floor(r*n), where r = sqrt(2/3); complement of A184809.
 A184809 (program): a(n) = n + floor(sqrt(3/2)*n).
 A184877 (program): a(n) = n^2(n2)^2(n4)^2…(1 or 2)^2.
 A184882 (program): a(n)=14n4n^2.
 A184901 (program): n+floor(ns/r)+floor(nt/r), where r=(1+sqrt(5))/2, s=r+1, t=r+2.
 A184903 (program): n+floor(nr/t)+floor(ns/t), where r=(1+sqrt(5))/2, s=r+1, t=r+2.
 A184921 (program): n+[rn/s]+[tn/s]+[un/s], where []=floor and r=2^(1/2), s=r+1, t=r+2, u=r+3.
 A184922 (program): n+[rn/t]+[sn/t]+[un/t], where []=floor and r=2^(1/2), s=r+1, t=r+2, u=r+3.
 A184959 (program): Fibonacci sequence beginning 10, 9.
 A184985 (program): Nonnegative integers excluding 2.
 A185009 (program): Row sums of A051949 (differences of factorial numbers), seen as a triangle.
 A185012 (program): Characteristic function of two.
 A185013 (program): Characteristic function of 3 .
 A185014 (program): Characteristic function of four.
 A185015 (program): Characteristic function of 5.
 A185016 (program): Characteristic function of 6.
 A185017 (program): Characteristic function of 7.
 A185018 (program): Inverse to sequence matrix for natural numbers.
 A185019 (program): a(n) = n(14n3).
 A185021 (program): a(n) = h(1)h(2)…h(n), where h(i) = i/[g(i/2)g(i/4)g(i/8)…] and g(x) = x if x is an integer and g(x) = 1 otherwise.
 A185027 (program): Sum of the triangular divisors of n.
 A185039 (program): Numbers of the form 9m^2 + 4m, m an integer.
 A185048 (program): Length of the continued fraction for floor(Fibonacci(n)*(1+sqrt(5))/2) / Fibonacci(n).
 A185049 (program): Last term in the continued fraction for floor(Fibonacci(n)*(1+sqrt(5))/2) / Fibonacci(n).
 A185055 (program): Number of representations of 5^(2n) as a sum a^2 + b^2 + c^2 with 0 < a <= b <= c.
 A185057 (program): a(n) = n^n! (mod 5).
 A185058 (program): a(n) = n^n! mod 7.
 A185061 (program): Position of the first occurrence of n in A193358 when it is considered to have the starting offset 1 instead of 0.
 A185065 (program): a(n) = n*(n^3 + 2).
 A185096 (program): Let T(n) = n(n+1)/2 be the nth triangular number (A000217); a(n) = T(8T(n)).
 A185102 (program): a(n) is the recursion depth of repeatedly factoring n and then the exponents in its prime product factorization, until 1 is reached.
 A185108 (program): a(0)=0; for n>0, a(n) = (n+2)*a(n1) + 1.
 A185109 (program): a(0)=2; for n > 0, a(n) = (n+2)*a(n1) + 1.
 A185114 (program): Number of connected 2regular simple graphs on n vertices with girth at least 4.
 A185115 (program): Number of connected 2regular simple graphs on n vertices with girth at least 5.
 A185116 (program): Number of connected 2regular simple graphs on n vertices with girth at least 6.
 A185117 (program): Number of connected 2regular simple graphs on n vertices with girth at least 7.
 A185118 (program): Number of connected 2regular simple graphs on n vertices with girth at least 8.
 A185119 (program): Number of connected 2regular simple graphs on n vertices with girth at least 9.
 A185123 (program): a(n) = n 9’s sandwiched between two 1’s.
 A185127 (program): a(n) = n 3’s sandwiched between two 1’s.
 A185138 (program): a(4n) = n(4n1); a(2n+1) = n(n+1)/2; a(4n+2) = (2n+1)(4*n+1).
 A185152 (program): Expansion of (q/2) * phi(q)^3 (d/dq) phi(q) in powers of q.
 A185170 (program): a(n) = floor( (2n^2  6n + 9) / 5).
 A185212 (program): a(n) = 12n^2  8n + 1.
 A185270 (program): a(n) = 648 * n^6.
 A185273 (program): Period 6: repeat [1, 6, 5, 6, 1, 0].
 A185277 (program): a(n) = n^9 + 9^n.
 A185294 (program): Number of disconnected 9regular simple graphs on 2n vertices with girth at least 4.
 A185322 (program): a(n) = ceiling(prime(n)/10).
 A185346 (program): a(n) = 2^n  9.
 A185353 (program): a(n) = (1^1 + 2^2 . . . + n^n) mod 10.
 A185355 (program): Number of n X n symmetric (0,1)matrices containing four ones.
 A185375 (program): a(n) = n(n1)(2n+1)(2n1)(2n3)(10*n17)/90.
 A185382 (program): Sum_ j=1..n1 P(n)P(j), where P(j) = A065091(j) is the jth odd prime.
 A185387 (program): E.g.f. exp(x)+log(1/(1x)).
 A185393 (program): Decimal expansion of e/(e1) = 1 + 1/e + 1/e^2 + …
 A185437 (program): The least number of colors required to color an nbead necklace so that each bead can be identified.
 A185438 (program): a(n) = 8n^2  2n + 1.
 A185452 (program): Image of n under the map n > n/2 if n even, (5*n+1)/2 if n odd.
 A185453 (program): Trajectory of 1 under repeated application of the map in A185452.
 A185456 (program): Payphone packing sequence.
 A185505 (program): a(n) = (7n^4 + 5n^2)/12.
 A185541 (program): a(n) = m*(m+1)/2, where m = floor(n^(3/2)).
 A185542 (program): a(n) = m*(m+1)/2, where m = floor(n^(5/2)).
 A185546 (program): a(n) = floor((1/2)*(n+1)^(3/2)); complement of A185547.
 A185549 (program): a(n) = ceiling(n^(3/2)); complement of A185550.
 A185593 (program): a(n) = floor(n^(3/2))*floor(3+n^(3/2))/2.
 A185594 (program): a(n) = floor((n^2+n)^(3/2)n^3).
 A185597 (program): a(n) = floor(n^(3/2)  n^(1/2)); complement of A185598.
 A185603 (program): a(n) = floor(floor(n^(5/2))^(1/2)); complement of A185604.
 A185634 (program): Number of nlength cycles from any point in a complete graph on n nodes.
 A185647 (program): Expansion of (1+2x)(1+2x^2)/((1x)(1+x)(12*x^2)).
 A185669 (program): a(n) = 4n^2 + 3n + 2.
 A185670 (program): Number of pairs (x,y) with 1 <= x < y <= n with at least one common factor.
 A185679 (program): Number of digits in decimal expansion of n^2.
 A185691 (program): Fibonacci sequence with initial terms 10 and 21.
 A185705 (program): Characteristic function of positive numbers that are primes ending in 1.
 A185706 (program): Characteristic function of positive numbers that are primes ending in 3.
 A185708 (program): Characteristic function of positive numbers that are primes ending in 7.
 A185709 (program): Characteristic function of positive numbers that are primes ending in 9.
 A185712 (program): a(n) = number of primes <= n that end in 3.
 A185714 (program): a(n) = number of primes <= n that end in 7.
 A185721 (program): Arises in the maximum number of C5’s in a trianglefree graph.
 A185727 (program): Integers of the form A145911(k)/(k+1) sorted along increasing k.
 A185761 (program): Number of (n+1) X 2 binary arrays with no 2 X 2 subblock trace equal to any horizontal or vertical neighbor 2 X 2 subblock trace.
 A185782 (program): Weight array of A185780, by antidiagonals.
 A185787 (program): Sum of first k numbers in column k of the natural number array A000027; by antidiagonals.
 A185788 (program): Sum of the first k1 numbers in the kth column of the natural number array A000027, by antidiagonals.
 A185826 (program): Sum of the next n natural numbers raised to the nth power.
 A185828 (program): Half the number of n X 2 binary arrays with every element equal to exactly one or two of its horizontal and vertical neighbors.
 A185868 (program): (Odd,odd)polka dot array in the natural number array A000027, by antidiagonals.
 A185869 (program): (Odd,even)polka dot array in the natural number array A000027; read by antidiagonals.
 A185870 (program): (Even,odd)polka dot array in the natural number array A000027, by antidiagonals.
 A185871 (program): (Even,even)polka dot array in the natural number array A000027, by antidiagonals.
 A185906 (program): Weight array of A000007 (which has only one nonzero term and whose second accumulation array is the multiplication table for the positive integers), by antidiagonals.
 A185907 (program): Weight array of A185908, by antidiagonals.
 A185908 (program): Array: T(n,k) = n1 + min n,k , by antidiagonals.
 A185910 (program): Array: T(n,k) = n^2 + k  1, by antidiagonals.
 A185914 (program): Array: T(n,k)=kn+1 for k>=n; T(n,k)=0 for k<n; by antidiagonals.
 A185918 (program): a(n) = 12n^2  2n  1.
 A185939 (program): a(n) = 9n^2  6n + 2.
 A185940 (program): a(n) = 1  2^(n+1) + 3^(n+2).
 A185950 (program): a(n) = 4*n^2  n  1.
 A185963 (program): Row sums of number triangle A185962.
 A185968 (program): a(n) = n^2*2^(n^21).
 A186002 (program): Hankel transform of A186001.
 A186025 (program): a(n) = 0^n + 1  F(n1)^2  F(n)^2, where F = A000045.
 A186029 (program): a(n) = n(7n+3)/2.
 A186030 (program): a(n) = n(13n3)/2.
 A186032 (program): a(n) = (1)^A048881(n).
 A186080 (program): Fourth powers that are palindromic in base 10.
 A186099 (program): Sum of divisors of n congruent to 1 or 5 mod 6.
 A186101 (program): a(n) = 2*n / 3 if n divisible by 3, a(n) = n otherwise.
 A186113 (program): a(n) = 13*n + 6.
 A186144 (program): Number of elements in the symmetric group S_n whose distance from a fixed element is the group diameter under compositions of (1,2) and (1,2,…,n).
 A186145 (program): Rank of n^2 when i^2: i>=1 and j^3: j>=1 are jointly ranked with i^2 before j^3 when i^2=j^3. Complement of A186146.
 A186146 (program): Rank of n^3 when i^2: i>=1 and j^3: j>=1 are jointly ranked with i^2 before j^3 when i^2=j^3. Complement of A186145.
 A186147 (program): Rank of n^3 when i^2: i>=1 and j^3: j>=1 are jointly ranked with i^2 after j^3 when i^2=j^3. Complement of A135674.
 A186148 (program): Rank of (1/4)n^3 when (1/4)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/4)i^3 before j^2 when (1/4)i^3=j^2. Complement of A186149.
 A186149 (program): Rank of n^2 when (1/4)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/4)i^3 before j^2 when (1/4)i^3=j^2. Complement of A186148.
 A186150 (program): Rank of (1/4)n^3 when (1/4)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/4)i^3 after j^2 when (1/4)i^3=j^2. Complement of A186151.
 A186151 (program): Rank of n^2 when (1/4)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/4)i^3 after j^2 when (1/4)i^3=j^2. Complement of A186150.
 A186153 (program): Rank of n^2 when (1/8)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/8)i^3 before j^2 when (1/8)i^3=j^2. Complement of A186152.
 A186154 (program): Rank of (1/8)n^3 when (1/8)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/8)i^3 after j^2 when (1/8)i^3=j^2. Complement of A186155.
 A186155 (program): Rank of n^2 when (1/8)i^3: i>=1 and j^2>: j>=1 are jointly ranked with (1/8)i^3 after j^2 when (1/8)i^3=j^2. Complement of A186154.
 A186157 (program): Rank of 2n^2 when i^3: i>=1 and 2j^2: j>=1 are jointly ranked with i^3 before 2j^2 when i^3=2j^2. Complement of A186156.
 A186181 (program): Period 4 sequence [ 2, 2, 3, 2, …] except a(0) = 1.
 A186187 (program): Period 8 sequence [ 2, 2, 1, 2, 4, 2, 1, 2, …] except a(0) = 1.
 A186188 (program): Least k such that A156077^(k)(n)=1 where a^(k)=a(a^(k1)).
 A186189 (program): least k such that A074286^(k)(n)=1 where a^(k)=a(a^(k1)).
 A186194 (program): A002275(n) * (A002275(n)+1).
 A186219 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the triangular numbers and squares. Complement of A186220.
 A186220 (program): Adjusted joint rank sequence of (g(i)) and (f(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the triangular numbers and squares. Complement of A186219.
 A186221 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers and squares. Complement of A186222.
 A186222 (program): Adjusted joint rank sequence of (g(i)) and (f(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers and squares. Complement of A186221.
 A186224 (program): Adjusted joint rank sequence of (g(i)) and (f(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the triangular numbers and pentagonal numbers. Complement of A186223.
 A186225 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers and pentagonal numbers. Complement of A186226.
 A186226 (program): Adjusted joint rank sequence of (g(j)) and (f(i)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers and pentagonal numbers. Complement of A186225.
 A186228 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the triangular numbers and heptagonal numbers. Complement of A186227.
 A186231 (program): Expansion of ( 2F1([1/4, 1/4]; [1/2], 16x)  1 ) / (2x).
 A186237 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers (A000217) and heptagonal numbers (A000566). Complement of A186238.
 A186245 (program): a(n) = binomial(n^2, 2*n).
 A186274 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the triangular numbers and octagonal numbers. Complement of A186159.
 A186276 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the triangular numbers and octagonal numbers. Complement of A186275.
 A186288 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and pentagonal numbers. Complement of A186289.
 A186289 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and pentagonal numbers. Complement of A186289.
 A186290 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the squares and pentagonal numbers. Complement of A186291.
 A186293 (program): (A007519(n)1)/2.
 A186294 (program): (A007519(n)+1)/2.
 A186295 (program): A007519(n)2.
 A186296 (program): ( A007520(n)+1 )/2.
 A186297 (program): ( A007520(n)1)/2.
 A186298 (program): A007520(n)2.
 A186299 (program): (A007521(n)1)/2.
 A186300 (program): (A007521(n)+1)/2.
 A186301 (program): a(n) = A007521(n)  2.
 A186302 (program): ( A007522(n)1 )/2.
 A186303 (program): ( A007522(n)+1 )/2.
 A186304 (program): A007522(n)2.
 A186305 (program): n^((p1)/2) (mod p) for p = 29.
 A186313 (program): Baron Munchhausen’s OmniSequence.
 A186315 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and hexagonal numbers. Complement of A186316.
 A186316 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and hexagonal numbers. Complement of A186315.
 A186317 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the squares and hexagonal numbers. Complement of A186318.
 A186318 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the squares and hexagonal numbers. Complement of A186317.
 A186320 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and heptagonal numbers. Complement of A186321.
 A186321 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and heptagonal numbers. Complement of A186320.
 A186322 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the squares and heptagonal numbers. Complement of A186323.
 A186324 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and octagonal numbers. Complement of A186325.
 A186325 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and octagonal numbers. Complement of A186324.
 A186326 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the squares and octagonal numbers. Complement of A186327.
 A186328 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the pentagonal numbers and the hexagonal numbers. Complement of A186329.
 A186329 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the pentagonal numbers and the hexagonal numbers. Complement of A186328.
 A186330 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the pentagonal numbers and the hexagonal numbers. Complement of A186331.
 A186331 (program): Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) after g(j) when f(i)=g(j), where f and g are the pentagonal numbers and the hexagonal numbers. Complement of A18633