Summary of block A115
Sequences in block A115
Section titled “Sequences in block A115”-
A115006: Row 2 of array in A114999.
-
A115007: Row 3 of array in A114999.
-
A115008: a(n) = a(n-1) + a(n-3) + a(n-4).
-
A115020: Count backwards from 100 in steps of 7.
-
A115032: Expansion of (5-14*x+x^2)/((1-x)*(x^2-18*x+1)).
-
A115067: a(n) = (3*n^2 - n - 2)/2.
-
A115098: a(0) = 2, a(n) = 3*a(n-1) - 3.
-
A115099: a(0)=4, a(n) = 3*a(n-1) - 4.
-
A115102: a(0)=2, a(1)=8, a(n) = a(n-1) + 2*a(n-2).
-
A115112: Number of different ways to select n elements from two sets of n elements under the precondition of choosing at least one element from each set.
-
A115125: A sequence related to Catalan numbers A000108.
-
A115180: Beatty sequence for (Champernowne constant)*10 = 1.234567891011121314…
-
A115181: Beatty sequence for (Cc/(Cc-1)) with Cc = 1.234567891011121314… = 10*(Champernowne constant).
-
A115200: The only alternating groups A_n which are ambivalent (see definition below).
-
A115243: G.f.: (4*x^2 + 2*x)/(4*x^3 - x^2 - 4*x + 1).
-
A115245: Partial sums of A011764.
-
A115273: a(n) = floor(n/3)*(n mod 3).
-
A115274: a(n) = n + A115273(n), where A115273(n) = 0 for n = 1..3.
-
A115285: Diagonal sums of correlation triangle for 1,3,4,4,4,…(A113311).
-
A115291: Expansion of (1+x)^3/(1-x).
-
A115339: a(2n-1)=F(n+1), a(2n)=L(n), where F(n) and L(n) are the Fibonacci and the Lucas sequences.
-
A115342: a(n) = 1 + (n-6)*2^(n-1).
-
A115357: Period 6: repeat [1,1,1,0,2,0].
-
A115360: Period 6: repeat [1,-1,1,0,0,0].
-
A115384: Partial sums of Thue-Morse numbers A010060.
-
A115419: Numbers having a 1 in position 3 of their binary expansion.
-
A115420: Numbers having a 1 in position 4 of their binary expansion.
-
A115451: Expansion of 1/((1+x)*(1-2*x)*(1+x^2)).
-
A115489: Number of monic irreducible polynomials of degree 3 in GF(2^n)[x].
-
A115490: Number of monic irreducible polynomials of degree 4 in GF(2^n)[x].
-
A115491: Number of monic irreducible polynomials of degree 5 in GF(2^n)[x].
-
A115500: Number of monic irreducible polynomials of degree 1 in GF(2^n)[x1,x2,x3,x4].
-
A115504: Number of monic irreducible polynomials of degree 1 in GF(2^n)[x1,x2,x3,x4,x5].
-
A115519: n*(1+3*n+6*n^2)/2.
-
A115562: a(n) = number of distinct squarefree ternary (cyclic) sequences uniquely containing every possible length-n substring.
-
A115565: a(n) = 5*n^4 - 10*n^3 + 20*n^2 - 15*n + 11.
-
A115590: a(0) = 0; a(n) = (1+a(n-1))^3 for n > 0.
-
A115598: Consider all Pythagorean triples (X,X+1,Z) ordered by increasing Z; sequence gives Z-(X+1) values.
-
A115599: Consider all Pythagorean triples (X,X+1,Z) ordered by increasing Z; sequence gives Z-X values.
-
A115603: My teacher gave this as a “riddle”.
-
A115605: Expansion of -x^2*(2 + x - 2*x^2 - x^3 + 2*x^4) / ( (x-1)*(1+x)*(1 + x + x^2)*(x^2 - x + 1)*(x^2 + 4*x - 1)*(x^2 - x - 1) ).
-
A115618: 1 + (n+6)*2^(n-1).
-
A115634: Expansion of (1-4*x^2)/(1-x^2).
-
A115659: Permutation of natural numbers generated by 2-rowed array shown below.
-
A115730: a(n) = a(n-3) + A001654(n-1) with a(0)=0, a(1)=0 and a(2)=1.
-
A115789: a(n) = (floor((n+1)*Pi) - floor(n*Pi)) mod 2.
-
A115790: a(n) = 1 - (floor((n+1)*Pi) - floor(n*Pi)) mod 2.
-
A115792: a(n) = ceiling(g(A000073(n))) with g(k) = (k-1)^2/(4k).
-
A115851: G.f. x^2*(-1+x+x^2)/((1-x)*(2*x-1)*(x+1)*(x^2+1)).
-
A115852: Dihedral D3 elliptical invariant transform on A000045: a[n+1]/a[n]= Phi^4=((1+Sqrt[5])/2)^4.
-
A115880: Largest positive x satisfying the Diophantine equation x^2 = y*(y+n), a(n)=0 if there are no solutions.
-
A115881: a(n) is the largest positive y satisfying the Diophantine equation x^2=y(y+n). a(n)=0 if there are no solutions.
-
A115902: Expansion of (1-8*x)^(-3/2).
-
A115903: Expansion of (1-12*x)^(-3/2).
-
A115992: Number of non-attacking queens that can be placed on a “hyper-chessboard” = hypercube of size 3, dimension n. That is, the size of the largest subset S of {0,1,2}^n such that for each pair (x0,y0,…), (x1,y1,…) of distinct elements of S, the absolute differences vector (|x1-x0|, |y1-y0|, …) has at least two distinct non-null coordinates.