Skip to content

Summary of block A105

73 sequences
  • A105035: Positions of record values in A104234.

  • A105038: Nonnegative n such that 6*n^2 + 6*n + 1 is a square.

  • A105058: Expansion of g.f. (1+8*x-x^2)/((1+x)*(1-6*x+x^2)).

  • A105062: Triangle read by rows, based on the morphism f: 1->2, 2->3, 3->4, 4->5, 5->6, 6->{6,6,10,7}, 7->8, 8->9, 9->10, 10->11, 11->12, 12->{12,12,5,1}. First row is 1. If current row is a,b,c,…, then the next row is a,b,c,…,f(a),f(b),f(c),…

  • A105067: a(n) = Sum_{j=0..11} n^j.

  • A105073: Define a(1)=0, a(2)=2 then a(n) = 3*a(n-1) - a(n-2), a(n+1) = 3*a(n)-a(n-1) and a(n+2) = 3*a(n+1) - a(n) + 2.

  • A105082: Expansion of (5+4x)/(1-2x-x^2).

  • A105163: a(n) = (n^3 - 7*n + 12)/6.

  • A105183: a(n) = 1 + a(n-1)*(a(n-1) + 1), with a(0)=2.

  • A105187: a(n) = determinant of the n X n matrix m(i,j) = (i+j+2)!/i!/j!.

  • A105198: a(n) = n(n+1)/2 mod 4.

  • A105206: Number of edges in a pancyclic graph on n+2 vertices with the fewest possible edges.

  • A105220: Trajectory of 1 under the morphism 1->{1,2,1}, 2->{2,2,2}.

  • A105225: a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = -1, a(2) = -2.

  • A105279: a(0)=0; a(n) = 10*a(n-1) + 10.

  • A105280: a(0)=0; a(n) = 11*a(n-1) + 11.

  • A105281: a(0)=0; a(n) = 6*a(n-1) + 6.

  • A105332: a(n) = n*(n+1)/2 mod 8.

  • A105333: a(n) = n*(n+1)/2 mod 16.

  • A105334: a(n) = n*(n+1)/2 mod 32.

  • A105335: a(n) = n*(n+1)/2 mod 64.

  • A105336: a(n) = n*(n+1)/2 mod 128.

  • A105337: a(n) = n*(n+1)/2 mod 256.

  • A105338: a(n) = n*(n+1)/2 mod 512.

  • A105343: Elements of even index in the sequence gives A005893, points on surface of tetrahedron: 2n^2 + 2 for n > 1.

  • A105344: Number of ways of placing n balls into n boxes and then into n containers.

  • A105356: Records in A105354.

  • A105367: Expansion of (1-x^3)/(1-x^5).

  • A105368: Expansion of (1-x-x^3+x^4)/(1-x^5).

  • A105374: a(n) = 4*n^3 + 4*n.

  • A105384: Expansion of x/(1 + x + x^2 + x^3 + x^4).

  • A105396: A simple “Fractal Jump Sequence” (FJS).

  • A105397: Periodic with period 2: repeat [4,2].

  • A105398: A simple “Fractal Jump Sequence” (FJS).

  • A105426: a(0)=1, a(1)=5, a(n)=8*a(n-1)-a(n-2).

  • A105427: Numbers n such that the near-repdigit number consisting of a 1 followed by n 3’s (i.e., of form 1333…33) is composite.

  • A105471: a(n) = Fibonacci(n) mod 100.

  • A105476: Number of compositions of n when each even part can be of two kinds.

  • A105510: Number of indecomposable self-dual ternary codes of length 4n.

  • A105564: Number of blocks of exactly 4 Fibonacci numbers having equal length <= n.

  • A105566: Number of blocks of exactly 5 Fibonacci numbers having equal length <= n.

  • A105576: a(n) = 2*a(n-1) - 3*a(n-2) + 2*a(n-3) with a(0) = 3, a(1) = 4, a(2) = 0.

  • A105577: a(n) = 2*a(n-1) - 3*a(n-2) + 2*a(n-3) with a(0) = 1, a(1) = 5, a(2) = 6.

  • A105578: a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 1, a(2) = 0.

  • A105579: a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 3, a(2) = 4.

  • A105635: a(n) = (2*Pell(n+1) - (1+(-1)^n))/4.

  • A105636: Transform of n^3 by the Riordan array (1/(1-x^2), x).

  • A105637: a(n) = a(n-2) + a(n-3) - a(n-5).

  • A105638: Maximum number of intersections in self-intersecting n-gon.

  • A105644: a(n) = floor((Pi+e)*n).

  • A105674: Highest minimal distance of any Type I (strictly) singly-even binary self-dual code of length 2n.

  • A105675: Highest minimal distance of any Type II doubly-even binary self-dual code of length 8n.

  • A105676: Highest minimal Hamming distance of any Type 3 ternary self-dual code of length 4n.

  • A105677: Highest minimal Hamming distance of any Type 4^E Euclidean linear self-dual code over GF(4) of length 2n.

  • A105678: Highest minimal Hamming distance of any Type 4^H Hermitian linear self-dual code over GF(4) of length 2n.

  • A105693: a(n) = Fibonacci(2n+2)-2^n.

  • A105694: 10^n-10^(n-2).

  • A105723: a(n) = 3^n - (-1)^n.

  • A105734: Duplicate of A076839.

  • A105752: Expansion of e.g.f. cos(i*log(1 + x)), i = sqrt(-1).

  • A105770: Expansion of (x^2-x+1)*(4*x^2+x+1) / ((1+x+x^2)*(1-x)^3).

  • A105811: Expansion of g.f. (1+x-x^2)/(1+x)^2.

  • A105812: Expansion of (1+x-x^2)/(1+x).

  • A105850: a(n+1) = a(n)^2 - 2^(2^n+1) with a(1) = 8.

  • A105870: Fibonacci sequence (mod 7).

  • A105899: Period 6: repeat [1, 1, 2, 2, 3, 3].

  • A105926: First differences of A000166.

  • A105939: a(n) = binomial(n+3,3)*binomial(n+6,3).

  • A105955: a(n) = Fibonacci(n) mod 11.

  • A105963: Expansion of (1+4*x)/(1-x-3*x^2).

  • A105968: a(n) = 4*a(n-1) - a(n-2) - 2*(-1)^n, a(0) = 1, a(1) = 4.

  • A105994: Fibonacci sequence (mod 13).

  • A105995: Fibonacci sequence (mod 14).