Summary of block A131
Sequences in block A131
Section titled “Sequences in block A131”-
A131015: Period 12: repeat 1, 1, 3, 2, 2, 1, 4, 4, 2, 3, 3, 4.
-
A131017: Period 6: repeat [1, 1, 2, -1, 2, 1].
-
A131023: First subdiagonal of triangular array T: T(j,1) = 1 for ((j-1) mod 6) < 3, else 0; T(j,k) = T(j-1,k-1) + T(j-1,k) for 2 <= k <= j.
-
A131026: Periodic sequence (2, 2, 1, 0, 0, 1).
-
A131027: Period 6: repeat [4, 3, 1, 0, 1, 3].
-
A131028: Periodic sequence (7, 4, 1, 1, 4, 7).
-
A131029: Periodic sequence (11, 5, 2, 5, 11, 14).
-
A131040: a(n) = (1/2+1/2*i*sqrt(11))^n + (1/2-1/2*i*sqrt(11))^n, where i=sqrt(-1).
-
A131042: Natural numbers A000027 with 6n+3 and 6n+4 terms swapped.
-
A131051: Row sums of triangle A133805.
-
A131055: 1 followed by repeats of 2*k.
-
A131056: A007318 * A131055.
-
A131064: Binomial transform of [1, 1, 5, 5, 5, …].
-
A131066: Binomial transform of [1, 1, 6, 6, 6, …].
-
A131068: Binomial transform of [1, 1, 7, 7, 7, …].
-
A131078: Periodic sequence (1, 1, 1, 1, 0, 0, 0, 0).
-
A131079: Periodic sequence (2, 2, 2, 1, 0, 0, 0, 1).
-
A131090: First differences of A131666.
-
A131091: Partial sums of A131707.
-
A131093: a(1)=1, a(n) = a(n-1) + sum of odd numbers which are among the first (n-1) terms of the sequence.
-
A131098: Partial sums of A151798.
-
A131119: a(n) = (-1)^n * Sum_{i=1..floor(n/2)} i * floor(n/(n-i)).
-
A131128: Binomial transform of [1, 1, 5, 1, 5, 1, 5, …].
-
A131130: Binomial transform of [1,1,7,1,7,1,7,1,…].
-
A131132: a(n) = a(n-1) + a(n-2) + 1 if n is a multiple of 6, otherwise a(n) = a(n-1) + a(n-2).
-
A131174: a(2n) = 2*A000217(n), a(2n+1) = A000217(n).
-
A131176: a(n) = (n^5-n-10)/10.
-
A131179: a(n) = if n mod 2 == 0 then n*(n+1)/2, otherwise (n-1)*n/2 + 1.
-
A131186: Period 12: repeat 0, 1, 2, 0, 2, 4, 0, 4, 3, 0, 3, 1.
-
A131189: Numbers n >= 0 such that d(n) = (n^1 + 1)*(n^2 + 2) … (n^14 + 14) / 14!, e(n) = (n^1 + 1)*(n^2 + 2) … (n^15 + 15) / 15!, and f(n) = (n^1 + 1)*(n^2 + 2) … (n^16 + 16) / 16! take nonintegral values.
-
A131209: Maximal distance between two signed permutations of n elements.
-
A131229: Numbers congruent to {1,7} mod 10.
-
A131234: Starts with 1, then n appears Fibonacci(n-1) times.
-
A131242: Partial sums of A059995: a(n) = sum_{k=0..n} floor(k/10).
-
A131259: a(2*n) = A000217(n), a(2*n+1) = -2*A000217(n).
-
A131262: a(n) = least index k such that A130654(k) = n.
-
A131269: a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4) with n>3, a(0)=1, a(1)=2, a(2)=3, a(3)=6.
-
A131282: Period 6: repeat [1, 2, 3, 3, 4, 5].
-
A131290: 1 followed by period 6: repeat [3, 2, 0, -1, 0, 2].
-
A131293: Concatenate a(n-2) and a(n-1) to get a(n); start with a(0)=0, a(1)=1, delete the leading zero. Also: concatenate Fibonacci(n) 1’s.
-
A131294: a(n)=ds_3(a(n-1))+ds_3(a(n-2)), a(0)=0, a(1)=1; where ds_3=digital sum base 3.
-
A131300: a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4) with n>3, a(0)=1, a(1)=2, a(2)=3, a(3)=7.
-
A131326: Row sums of A131325.
-
A131328: Row sums of triangle A131327.
-
A131352: Row sums of triangle A133935.
-
A131355: Partial sums of A065423 plus one.
-
A131358: a(3*k) = 0, a(3*k+1) = k+1, a(3*k+2) = -k.
-
A131360: a(4n) = a(4n+1) = 0, a(4n+2) = 2n, a(4n+3) = 2n+1.
-
A131372: Period 7: repeat [1, -1, 0, 1, 0, -1, 1].
-
A131379: Period 4: repeat [1, 0, -1, 1].
-
A131380: a(3n) = 2n, a(3n+1) = 2n+2, a(3n+2) = 2n+1.
-
A131386: a(n) = (-1)^n*n*(n-2).
-
A131403: Row sums of triangle A131402.
-
A131405: Row sums of triangle A131404.
-
A131406: 3*A128174 - 2*A000012(signed).
-
A131412: a(n) = n*(Fibonacci(n) - 1) + Fibonacci(n + 2) - 1.
-
A131421: Triangle read by rows (n>=1, 1<=k<=n): T(n,k) = 2*(n+k) - 3.
-
A131423: a(n) = n*(n+2)*(2*n-1)/3. Also, row sums of triangle A131422.
-
A131428: a(n) = 2*C(n) - 1, where C(n) = A000108(n) are the Catalan numbers.
-
A131438: (2+n)*2^n-2-3*n.
-
A131439: Inverse binomial transform of A131438 (assuming zero offset in both sequences).
-
A131452: a(3n)=4n, a(3n+1)=4n+2, a(3n+2)=4n+1.
-
A131464: a(n) = 4*n^3 - 3*n^2 + 2*n - 1.
-
A131465: a(n)=4n^4-3n^3+2n^2-n+1.
-
A131471: a(n) = n^5+n.
-
A131472: a(n) = n^6 + n.
-
A131473: a(n) = n^6 - n.
-
A131474: a(n) = ceiling(n/2)*ceiling(n^2/2).
-
A131475: a(n) = floor(n/2) * floor(n^2/2).
-
A131476: a(n) = floor(n^3/3).
-
A131477: a(n) = ceiling(n^3/3).
-
A131478: a(n) = ceiling(n^4/4).
-
A131479: a(n) = floor(n^4/4).
-
A131501: Xm/CV where Xm is a point of maximum error using an approximation method for x^(1/2) which I have found and CV is the population coefficient of variation from my list of error values.
-
A131505: n, -1, n, 2n+2.
-
A131506: 2n+1 appears 2n-1 times.
-
A131507: 2n+1 appears n+1 times.
-
A131508: 2*A000027 (natural numbers) sandwiched by tripled A001477 (nonnegative numbers).
-
A131520: Number of partitions of the graph G_n (defined below) into “strokes”.
-
A131524: Number of possible palindromic rows (or columns) in an n X n crossword puzzle.
-
A131531: Period 6: repeat [0, 0, 1, 0, 0, -1].
-
A131532: Period 6: repeat [0, 0, 0, 0, 1, 1].
-
A131533: Period 6: repeat [0, 0, 0, 0, 1, -1].
-
A131534: Period 3: repeat [1, 2, 1].
-
A131554: Period 5: repeat [1, 1, -1, 1, -1].
-
A131555: Period 6: repeat [0, 0, 1, 1, 2, 2].
-
A131556: Period 6: repeat [1, -2, 1, -1, 2, -1].
-
A131561: Period 3: repeat [1, 1, -1].
-
A131562: a(n)= -3a(n-1) -3a(n-2)-2a(n-3), a(0)=1, a(1)=-2, a(2)=2.
-
A131568: a(n) = sum of numbers which in base 2 contain exactly n digits 1 and not more than n digits 0.
-
A131572: a(0) = 0 and a(1) = 1, continued such that absolute values of 2nd differences equal the original sequence.
-
A131575: First differences of A131572.
-
A131577: Zero followed by powers of 2 (cf. A000079).
-
A131579: Period 10: repeat 0, 3, 6, 9, 2, 5, 8, 1, 4, 7.
-
A131588: Interlaces A007583 with A083420.
-
A131598: Period 3: repeat [2, 5, 8].
-
A131612: (Fibonacci(n)^(n+1)-1)/(Fibonacci(n)-1).
-
A131628: Maximal size of an n-distance set in the plane.
-
A131649: Number of distinct improper 2-coloring of edges for odd-order cyclic graphs.
-
A131666: First differences of (A113405 prefixed with a 0).
-
A131669: Odd digits followed by positive even digits.
-
A131670: Period 5: repeat [1, 0, -1, 0, 1].
-
A131707: Period 12: repeat 1, 1, 3, 7, 7, 1, 9, 9, 7, 3, 3, 9 .
-
A131708: A024494 prefixed by a 0.
-
A131711: Period 12: repeat 0, 1, 2, 5, 2, 9, 0, 9, 8, 5, 8, 1.
-
A131712: Period 4: repeat [1, 3, 7, 9].
-
A131713: Period 3: repeat [1, -2, 1].
-
A131714: Period 6: repeat [1, -2, 2, -1, 2, -2].
-
A131716: Period 6: repeat [0, 1, 2, 5, 8, 9].
-
A131717: Natural numbers A000027 with 6n+4 and 6n+5 terms swapped.
-
A131718: Period 6: repeat [1, 1, 2, 1, 2, 1].
-
A131719: Period 6: repeat [0, 1, 1, 1, 1, 0].
-
A131720: Period 6: repeat [0, 1, -1, 1, -1, 0].
-
A131722: Period 6: repeat [0, 10, 10, 10, 10, 10].
-
A131723: a(2*n) = 1-n^2, a(2*n+1) = n*(n+1).
-
A131727: Pell numbers A000129 without last digit.
-
A131728: a(4n) = n, a(4n+1) = 2n+1, a(4n+2) = n+1, a(4n+3) = 0.
-
A131729: Period 4: repeat [0, 1, -1, 1].
-
A131730: a(4n) = n, a(4n+1) = -n-1, a(4n+2) = n+1, a(4n+3) = -n.
-
A131731: Period 4: repeat [2, -3, 4, -3].
-
A131734: Period 6: repeat [0, 1, 0, 1, 0, -1].
-
A131735: Period 6: repeat [0, 0, 1, 1, 1, 1].
-
A131736: Period 6: repeat [0, 0, 1, -1, -1, 1].
-
A131737: Essentially even numbers followed by duplicated odd numbers.
-
A131738: a(0) = 0. a(n) = (n+1)*(-1)^n, n>0 .
-
A131739: a(4n) = a(4n+1) = n, a(4n+2) = 3n+2, a(4n+3) = 3n+3.
-
A131742: a(4n) = a(4n+1) = 0, a(4n+2) = 3n+1, a(4n+3) = 3n+2.
-
A131743: Period 4: repeat [0, 1, 0, 2].
-
A131751: Numbers that are both centered triangular and centered pentagonal.
-
A131756: Period 3: repeat [2, -1, 3].
-
A131780: Row sums of triangle A131779.
-
A131793: 3 odds, 3 evens.
-
A131800: Period 4: repeat [1, 2, 5, 6].
-
A131804: Antidiagonal sums of triangular array T: T(j,k) = -(k+1)/2 for odd k, T(j,k) = 0 for k = 0, T(j,k) = j+1-k/2 for even k > 0; 0 <= k <= j.
-
A131805: Row sums of triangular array T: T(j,k) = -(k+1)/2 for odd k, T(j,k) = 0 for k = 0, T(j,k) = j+1-k/2 for even k > 0; 0 <= k <= j.
-
A131806: Period 4: repeat [0, 2, 4, 6].
-
A131811: Number of symbolic sequences on n symbols that can be realized by the arrangement of the real roots of some polynomial of degree n and its derivatives.
-
A131818: A130296 + A002260 - A000012. Triangle read by rows: row n consists of n, 2, 3, 4, …, n.
-
A131820: Row sums of triangle A131819.
-
A131831: Duplicate of A100314.
-
A131833: a(n) = 2^(n+1) - 1 + 3*n.
-
A131865: Partial sums of powers of 16.
-
A131870: Period 8: repeat [1, 2, 3, 4, 6, 7, 8, 9].
-
A131874: a(n) = (7*n^2 + 15*n + 2) / 2.
-
A131877: a(n) = 14*n + 1.
-
A131885: a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) for n >= 4 starting with a(0) = 1, a(1) = 2, a(2) = 4, and a(3) = 6.
-
A131895: a(n) = (n + 2)*(5*n + 1)/2.
-
A131898: a(n) = 2^(n+1) + 2*n - 1.
-
A131912: Row sums of triangle A131911.
-
A131924: Row sums of triangle A131923.
-
A131941: Partial sums of ceiling(n^2/2) (A000982).
-
A131949: Row sums of triangle A131948.
-
A131951: a(n) = 2^n + n*(n+3).
-
A131959: Numbers k such that 1 + Product_{j=1..k} prime(j)^prime(k-j+1) is prime.
-
A131965: a(n) = 1 + Sum_{i=2..n-1} n*a(i).
-
A131970: 1 followed by 2n 2’s.