Skip to content

Summary of block A140

106 sequences
  • A140058: Numbers > 24 that are congruent to {5,6,7,8,9} mod 10.

  • A140062: a(n) = 101*2^(n-1) - 100.

  • A140063: Binomial transform of [1, 3, 7, 0, 0, 0, …].

  • A140064: a(n) = (9*n^2 - 5*n + 2)/2.

  • A140065: a(n) = (7*n^2 - 17*n + 12)/2.

  • A140066: a(n) = (5*n^2 - 11*n + 8)/2.

  • A140081: Period 4: repeat [0, 1, 1, 2].

  • A140085: Period 8: repeat [0,1,1,2,1,2,2,3].

  • A140090: a(n) = n*(3*n + 7)/2.

  • A140091: a(n) = 3*n*(n + 3)/2.

  • A140144: a(1)=1, a(n)=a(n-1)+n^1 if n odd, a(n)=a(n-1)+ n^0 if n is even.

  • A140165: a(n) = -a(n-1) + 3*a(n-2), starting a(1)=1, a(2)=2.

  • A140167: a(n) = (-1)*a(n-1) + 3*a(n-2) with a(1)=-1 and a(2)=1.

  • A140184: a(n) = 2*a(n-1) + 16*a(n-2) + 16*a(n-3) for n>3 with a(1)=1, a(2)=14, a(3)=60.

  • A140201: Partial sums of A140081.

  • A140205: Partial sums of A140085.

  • A140220: a(n) = binomial(n+7, 7)*5^n.

  • A140226: Binomial transform of [1, 3, 3, 1, 1, -1, 1, -1, 1, …].

  • A140229: Binomial transform of [1, 3, 3, 1, -2, 3, -4, 5, …].

  • A140230: Binomial transform of [1, 2, -3, -4, 5, 6, -7, -8, 9, 10, …].

  • A140233: a(n) = floor(n*e^((1+sqrt(5))/2)) = floor(n*A139341).

  • A140252: Inverse binomial transform of A140420.

  • A140253: a(2*n) = 2*(2*4^(n-1)-1) and a(2*n-1) = 2*4^(n-1)-1.

  • A140260: Those n for which A140259(n) = A002264(n+11).

  • A140261: The length of Sapro’s necklace at successive years in Werneck’s Black Pearl Necklace problem.

  • A140282: Numbers k such that A000330(k) is multiple of 3.

  • A140285: Numbers which are both lucky (A000959) and tetranacci (A000078).

  • A140300: a(n) = 1024^n.

  • A140319: Exponential primorial: a(n)=prime(n)^a(n-1), a(0)=1, where prime(n)=A000040(n).

  • A140320: a(n) = A137576((3^n-1)/2).

  • A140322: a(n) = -1/6 + (-1)^n/2 + 2*4^n/3.

  • A140323: First differences of A140322.

  • A140325: a(n) = binomial(n+8,8) * 2^n.

  • A140345: a(n)=a(n-1)^2-a(n-2)-a(n-3)-a(n-4), a(1)=a(2)=a(3)=a(4)=1.

  • A140346: a(n) = binomial(n+8, 8)*5^n.

  • A140354: a(n) = binomial(n+9,9)*2^n.

  • A140359: a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3).

  • A140360: Inverse binomial transform of A140359.

  • A140397: a(n) = floor(3*phi*n) - 3*floor(phi*n) where phi = (1+sqrt(5))/2.

  • A140404: a(n) = binomial(n+5, 5)*7^n.

  • A140405: a(n) = binomial(n+6, 6)*5^n.

  • A140406: a(n) = binomial(n+6, 6)*8^n.

  • A140407: A000225 interleaved with A000051.

  • A140413: a(2n) = A000045(6n) + 1, a(2n+1) = A000045(6n+3) - 1.

  • A140420: Binomial transform of 0, 1, 1, 7, 7, 31, 31, …, zero followed by duplicated A083420.

  • A140426: Number of multi-symmetric Steinhaus matrices of size n.

  • A140427: Arises in relating doubly-even error-correcting codes, graphs and irreducible representations of N-extended supersymmetry.

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

  • A140430: Period 6: repeat [3, 2, 4, 1, 2, 0].

  • A140431: a(n) = 2*A094555(n).

  • A140441: Erroneous version of A071881.

  • A140455: 13-Fibonacci sequence.

  • A140472: a(n) = a(n - a(n-1)) + a(floor(n/2)).

  • A140477: Binomial(127,n).

  • A140504: a(n) = 2^n + 4.

  • A140520: a(n) = binomial(n+9, 9)*5^n.

  • A140529: a(n) = 6*4^n - 1.

  • A140590: Exchange successive pairs of terms of A000051.

  • A140592: a(n) = 2n if A010060(n-1) is 0, and a(n) = 2n+1 if A010060(n-1) is 1.

  • A140656: Arises in a simple, polynomial-time algorithm for the matrix torsion problem.

  • A140657: Powers of 2 with 3 alternatingly added and subtracted.

  • A140659: a(n) = floor(A140657(n+2)/10).

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

  • A140672: a(n) = n*(3*n + 13)/2.

  • A140673: a(n) = 3*n*(n + 5)/2.

  • A140674: a(n) = n*(3*n + 17)/2.

  • A140675: a(n) = n*(3*n + 19)/2.

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

  • A140677: a(n) = n*(3*n + 8).

  • A140678: a(n) = n*(3*n + 10).

  • A140679: a(n) = n*(3*n+14).

  • A140680: a(n) = n*(3*n+16).

  • A140681: a(n) = 3*n*(n+6).

  • A140683: a(n) = 3*(-1)^(n+1)*2^n - 1.

  • A140684: A037481 mod 10.

  • A140689: a(n) = n*(3*n + 20).

  • A140710: Number of maximal initial consecutive columns ending at the same level, summed over all deco polyominoes of height n.

  • A140716: Blocky integers, i.e., integers m > 1 such that there is a run of m consecutive integer squares the average of which is a square.

  • A140721: Alternated reading of A000302 and negated A002042.

  • A140725: Inverse binomial transform of (0 followed by A037481).

  • A140730: a(4*n)=5^n, a(4*n+1)=2*5^n, a(4*n+2)=3*5^n, a(4*n+3)=4*5^n.

  • A140766: a(n) = 6*a(n-1) - 6*a(n-2).

  • A140768: Prime convenient numbers.

  • A140780: a(n) = 10*a(n-1) - a(n-2) for n >= 2 with a(0) = 1 and a(1) = 3.

  • A140781: a(n) = 10*a(n-1) - a(n-2).

  • A140788: a(n) = 6*4^n + 2.

  • A140794: One of the four smallest counterexamples to the conjecture that the cardinality of the sumset is less than or equal to the cardinality of the difference set of every finite set of integers.

  • A140796: a(n)=a(n-1)+6a(n-2), n>2.

  • A140801: a(0)=360, a(n)=a(n-1)+720 for n>=1.

  • A140802: a(n) = binomial(n+3, 3)*8^n.

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

  • A140832: a(0) = 1; if a(n) is even, a(n + 1) = 5a(n)/2; if a(n) is odd, a(n + 1) is 5a(n)/2 rounded to the nearest even integer.

  • A140833: Sum of Fibonacci numbers between F(-n)…F(n), inclusive.

  • A140836: Number of inequivalent SQ matrices (strongly quadrangular) of order n.

  • A140837: Number of inequivalent indecomposable symmetric SQ matrices (strongly quadrangular) of order n.

  • A140838: Number of inequivalent symmetric SQ matrices (strongly quadrangular) of order n.

  • A140839: Number of inequivalent indecomposable regular SQ matrices (strongly quadrangular) of order n.

  • A140858: This sequence is identical with A075458.

  • A140860: Number of inequivalent regular SQ matrices (strongly quadrangular) of order n.

  • A140868: a(n) = floor(floor(n*alpha)*alpha) where alpha = 1+sqrt(2) = A014176.

  • A140955: Even integers that do not have at least two partitions into 2 distinct primes.

  • A140960: a(n) = (2*(-1)^n - 2^(n+1) + 3*n*2^n)/9.

  • A140962: Negative values of the inverse binomial transform of A045883.

  • A140966: a(n) = (5 + (-2)^n)/3.

  • A140976: Period length 10: repeat 8, 8, 6, 6, 4, 4, 2, 2, 0, 0.

  • A140979: a(n) = floor(2*phi*floor(n*phi)) where phi = A001622.