Skip to content

Summary of block A026

75 sequences
  • A026025: a(n) = (n!)^2 * (1 + Sum_{k=0..n-1} 1/((k+1)(k!)^2)).

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

  • A026037: a(n) = dot_product(1,2,…,n)*(3,4,…,n,1,2).

  • A026038: a(n) = (d(n)-r(n))/2, where d = A026037 and r is the periodic sequence with fundamental period (1,0,0,1).

  • A026040: a(n) = dot_product(1,2,…,n)*(4,5,…,n,1,2,3).

  • A026041: a(n) = d(n)/2, where d = A026040.

  • A026052: (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).

  • A026057: a(n) = n*(n^2 + 12*n - 25)/6.

  • A026097: a(n) = number of (s(0), s(1), …, s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4. Also a(n) = sum of numbers in row n+1 of the array T defined in A026082 and a(n) = 24*3^(n-4) for n >= 4.

  • A026121: a(n) = 3^n*(3^n-1)/2.

  • A026147: a(n) = position of n-th 1 in A001285 or A010059 (Thue-Morse sequence).

  • A026150: a(0) = a(1) = 1; a(n+2) = 2*a(n+1) + 2*a(n).

  • A026185: If n even, then 2n. If n odd, then nearest integer to 2n/3.

  • A026200: a(n) = (s(n) + 2)/3, where s(n) is the n-th number congruent to 1 mod 3 in A026166.

  • A026201: Position of n in A026200.

  • A026209: Duplicate of A026185.

  • A026218: a(n) = (1/3)*(s(n) + 2), where s(n) is the n-th number congruent to 1 mod 3 in A026177.

  • A026219: Position of n in A026218.

  • A026243: a(n) = A000522(n) - 2.

  • A026244: a(n) = 4^n*(4^n+1)/2.

  • A026273: a(n) = least k such that s(k) = n, where s = A026272.

  • A026274: Greatest k such that s(k) = n, where s = A026272.

  • A026315: |sin(n)| < |sin(n+1)|.

  • A026316: Numbers k such that |sin(k)| > |cos(k+1)|.

  • A026322: |sin(2n)| > |sin(n)|.

  • A026337: a(n) = 4^n*(4^n - 1)/2.

  • A026351: a(n) = floor(n*phi) + 1, where phi = (1+sqrt(5))/2.

  • A026352: a(n) = floor(n*tau) + n + 1 where tau is the golden ratio A001622.

  • A026353: a(n) = sum of the numbers between the two n’s in A026350.

  • A026355: a(n) = least k such that s(k) = n+1, where s = A026354.

  • A026356: a(n) = floor((n-1)*phi) + n + 1, n > 0, where phi = (1+sqrt(5))/2.

  • A026357: a(n) = sum of the numbers between the two n’s in A026354.

  • A026381: T(n,n-2), where T is the array in A026374.

  • A026383: a(n) = 5*a(n-2), starting 1,2.

  • A026384: a(n) = Sum_{j=0..i, i=0..n} T(i,j), where T is the array in A026374.

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

  • A026393: a(n) = T(n,n-2), where T is the array in A026386.

  • A026395: a(n) = 5*a(n-2), starting 1,2,4.

  • A026396: Sum_{T(i,j)}, 0<=j<=i, 0<=i<=n, where T is the array in A026386.

  • A026430: a(n) is the sum of first n terms of A001285 (Thue-Morse sequence).

  • A026474: a(n) = least positive integer > a(n-1) and not equal to a(i)+a(j) or a(i)+a(j)+a(k) for 1<=i<j<k<n (a 3-Stohr sequence).

  • A026484: Erroneous version of A026488.

  • A026488: a(n) is the least positive integer > a(n-1) and not a(i)*a(j)-a(k) for 1 <= i <= j <= k <= n, where a(1) = 1.

  • A026491: a(n) = least k > a(n-1) such that A001285(k-1) = A001285(n-1) for n >= 1.

  • A026492: a(n) = t(3n), where t = A001285 (Thue-Morse sequence).

  • A026498: a(n) = t(1+3n), where t = A001285 (Thue-Morse sequence).

  • A026513: a(n) = t(2+3n), where t = A001285 (Thue-Morse sequence).

  • A026532: Ratios of successive terms are 3, 2, 3, 2, 3, 2, 3, 2, …

  • A026534: a(n) = Sum_{i=0..2*n} Sum_{j=0..n-1} A026519(j, i).

  • A026549: Ratios of successive terms are 2, 3, 2, 3, 2, 3, 2, 3, …

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

  • A026565: a(n) = 6*a(n-2), starting with 1, 3, 9.

  • A026567: a(n) = Sum_{i=0..2*n} Sum_{j=0..i} T(i, j), where T is given by A026552.

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

  • A026583: a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=2n, T given by A026568.

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

  • A026599: a(n) = Sum_{j=0..2*i, i=0..n} A026584(i,j).

  • A026600: a(n) is the n-th letter of the infinite word generated from w(1)=1 inductively by w(n)=JUXTAPOSITION{w(n-1),w’(n-1),w”(n-1)}, where w(k) becomes w’(k) by the cyclic permutation 1->2->3->1 and w”(k) = (w’)‘(k).

  • A026601: Numbers k such that A026600(k) = 1.

  • A026619: a(n) = A026615(2*n-1, n-1).

  • A026622: a(n) = Sum_{k=0..n} A026615(n, k).

  • A026624: a(n) = Sum_{j=0..n} Sum_{k=0..j} A026615(j, k).

  • A026633: a(n) = Sum_{k=0..n} A026626(n, k).

  • A026635: a(n) = Sum_{i=0..n} Sum_{j=0..n} A026626(i,j).

  • A026644: a(n) = a(n-1) + 2*a(n-2) + 2, for n>=3, where a(0)= 1, a(1)= 2, a(2)= 4.

  • A026646: a(n) = Sum_{i=0..n} Sum_{j=0..n} A026637(i,j).

  • A026740: a(n) = 2^n*(2^n - 1)*(2^n - 2)/6.

  • A026741: a(n) = n if n odd, n/2 if n even.

  • A026806: a(n) = number of numbers k such that only one partition of n has least part k.

  • A026817: Duplicate of A022269.

  • A026834: a(n) = number of numbers k such that only one partition of n into distinct parts has least part k.

  • A026915: a(n) = T(n,0) + T(n,1) + … + T(n,n), T given by A026907.

  • A026922: Number of partitions of n into an odd number of parts, the greatest being 2; also, a(n+3) = number of partitions of n+1 into an even number of parts, each <=2.

  • A026937: a(n) = Sum_{k=0..n} (k+1)*T(n, n-k), where T is given by A008288.

  • A026955: a(n) = Sum_{k=0..n} (k+1) * T(n,k), with T given by A026386.