Summary of block A173
Sequences in block A173
Section titled “Sequences in block A173”-
A173000: a(n) = binomial(n + 4, 4)*9^n.
-
A173009: Expansion of o.g.f. x*(1 - x + x^2)/(1 -3*x +x^2 +3*x^3 -2*x^4).
-
A173010: a(n) = round((2^n - n - 1)/4).
-
A173012: a(1) = 1, for n >= 2; a(n) = the smallest number h such that sigma(h) = A000203(h) = a(n-1) + 2, a(n) = 0 if no such number exists.
-
A173013: a(1) = 1, for n >= 2; a(n) = the smallest number h such that sigma(h) = A000203(h) = a(n-1) + 3, a(n) = 0 if no such number exists.
-
A173014: a(1) = 1, for n >= 2; a(n) = the smallest number h such that sigma(h) = A000203(h) = a(n-1) + 4, a(n) = 0 if no such number exists.
-
A173026: Numbers k such that k + (k-th generalized non-cuban prime) = (k-th generalized cuban prime).
-
A173033: Second diagonal under the main diagonal in A172119 written in a square (see comment).
-
A173036: a(n) = binomial(n+1, 2) + 13.
-
A173041: a(n) = 2*10^n + 3.
-
A173067: a(n) = A130665(n-1) - A160715(n).
-
A173078: a(n) = (5*2^n - 2*(-1)^n - 9)/3.
-
A173089: a(n) = 25*n^2 + n.
-
A173093: a(1)=1, a(2)=3, a(n)=a(n-2)*a(n-1)-a(n-2).
-
A173094: a(1)=2, a(2)=3, a(n)=a(n-2)*a(n-1)-a(n-1).
-
A173096: a(1) = 3, a(2) = 4, a(n) = a(n-2)*a(n-1)-a(n-2)-a(n-1).
-
A173097: a(1)=1, a(2)=2, a(n)=2*a(n-2)*a(n-1)-a(n-2).
-
A173098: a(1)=1, a(2)=2, a(n)=2*a(n-2)*a(n-1)-a(n-1).
-
A173100: a(1)=2, a(2)=2, a(n)=2*a(n-2)*a(n-1)-a(n-2)-a(n-1).
-
A173102: Number of partitions x + y = z with {x,y,z} in {1,2,3,..,3*n} and z > y >= x.
-
A173113: a(n) = binomial(n + 10, 10) * 5^n.
-
A173114: a(0)=a(1)=1, a(n) = 2*a(n-1)- A010686(n), n>1.
-
A173115: a(n) = -(sin(2*n*arccos(sqrt(3))))^2.
-
A173116: a(n) = sinh(2*arcsinh(n))^2 = 4*n^2*(n^2 + 1).
-
A173121: a(n) = sinh(2*arccosh(n))^2 = 4*n^2*(n^2 - 1).
-
A173123: a(n) = binomial(n+9,9)*6^n.
-
A173124: a(n) = binomial(n+10,10)*6^n.
-
A173141: a(n) = 49*n^2 + n.
-
A173154: a(n) = n^3/6 + 3*n^2/4 + 7*n/3 + 7/8 + (-1)^n/8.
-
A173155: a(n) = binomial(n + 5, 5) * 8^n.
-
A173173: a(n) = ceiling(Fibonacci(n)/2).
-
A173184: Partial sums of A000166.
-
A173187: a(n) = binomial(n + 3, 3)*9^n.
-
A173191: a(n) = binomial(n + 6, 6)*9^n.
-
A173193: a(n) = (2*10^n + 43)/9.
-
A173196: Partial sums of A002620.
-
A173200: Solutions y of the Mordell equation y^2 = x^3 - 3a^2 - 1 for a = 0,1,2, … (solutions x are given by A053755).
-
A173202: Solutions y of the Mordell equation y^2 = x^3 - 3a^2 + 1 for a = 0,1,2, … (solutions x are given by the sequence A000466).
-
A173205: a(n) = 98*a(n-1)-a(n-2) for n>2, a(1)=1, a(2)=98.
-
A173209: Partial sums of A000069.
-
A173234: Expansion of x*(1+3*x^2-2*x^3+2*x^4-x^5)/((1+x)*(x-1)^2*(x^2+1)^2).
-
A173235: a(n) = n^(n-1) + n - 1.
-
A173237: Alternate k and 10k for each k.
-
A173254: a(n) = a(n-1) + a(n-2) - [a(n-2)/2] - [a(n-4)/2].
-
A173259: Period 3: repeat [4, 1, 4].
-
A173262: a(n) = (2*10^n + 61)/9.
-
A173263: Successive numbers n such that ChebyshevT[n/2, n] is not an integer.
-
A173267: a(n) = 121*n^2 + n.
-
A173275: a(n) = 169*n^2 + n.
-
A173276: a(n) = a(n-2) + a(n-3) - floor(a(n-3)/2) - floor(a(n-4)/2).
-
A173294: Values of 16*n^2+24*n+7, n>=0, each duplicated.
-
A173307: a(n) = 13*n*(n+1).
-
A173308: a(n) = 17*n*(n+1).
-
A173309: a(n) = 19*n*(n+1).
-
A173314: a(n) = 6*n!+1.
-
A173316: a(n) = 6*n! - 1.
-
A173317: a(n) = 5*n! - 1.
-
A173319: a(n) = 5*n! + 1.
-
A173321: a(n) = 4*n! - 1.
-
A173322: a(n) = 4*n! + 1.
-
A173323: a(n) = 3*n! - 1.
-
A173324: a(n) = 3*n! + 1.
-
A173343: a(n+4) = a(n+3) - 2*a(n+2) - a(n+1) - a(n).
-
A173344: a(n+4) = a(n+3) - 2*a(n+2) - a(n+1) - a(n), starting with (0, 1, 0, -2).
-
A173377: Numbers x such that 0 < |x^11 - y^9| < x^(79/9) for some number y.
-
A173391: a(n) = 6n + 3^n.
-
A173393: 10n+12^n.
-
A173432: NW-SE diagonal sums of Riordan array A112468.
-
A173433: a(n) = (A000045(n)+A173432(n))/2.
-
A173434: a(n) = (A000045(n)-A173432(n))/2.
-
A173449: Partial sums of A006894.
-
A173468: Sum n^k, k=0..n+1.
-
A173495: a(n) = Lucas(n) - floor(Lucas(n)/2).
-
A173497: a(n) = a(n-1) + a(n-2) - floor(a(n-2)/2), starting 2,1.
-
A173499: Number of sequences of length n with terms from {0,1,…,n-1} such that the sum of terms is 0 modulo n and the i-th term is not i.
-
A173501: a(1) = 2, a(2) = 3, a(n) = 6^(2^(n-3)) for n >= 3.
-
A173506: a(n) = (3^(3^n) - 1)/2.
-
A173508: a(n) = ceiling(A173497(n)/2).
-
A173510: a(n) = a(n-1) + a(n-2) - floor( a(n-1)/2 ).
-
A173511: a(n) = 4*n^2 + floor(n/2).
-
A173512: a(n) = 8*n + 4 + n mod 2.
-
A173513: a(n) = ceiling(A173510(n)/2).
-
A173516: a(1)=1, a(n) = 3*n*a(n-1) + 1, n > 1.
-
A173523: 1+A053735(n-1), where A053735 is the sum-of-digits function in base 3.
-
A173535: a(n) = (1/11) * (5*12^n + 6).
-
A173562: a(n) = n^2 + floor(n/4).
-
A173566: a(n+1) = a(n)^a(n), with a(1) = 2.
-
A173573: 3-Factorions: equal to the sum of the triple factorials of their digits in base 10.
-
A173574: 4-Factorions: equal to the sum of the quadruple factorials of their digits in base 10.
-
A173575: 5-Factorions: equal to the sum of the quintuple factorials of their digits in base 10.
-
A173577: 7-Factorions: equal to the sum of the 7-fold factorials of their digits in base 10.
-
A173598: Period 6: repeat [1, 8, 7, 2, 4, 5].
-
A173603: a(1) = 1, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 2.
-
A173604: a(1) = 1, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 3.
-
A173609: a(1) = 0, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 2.
-
A173635: Period 5 sequence: 1, 1, 4, 4, 2, …
-
A173653: Partial sums of floor(n^2/10) (A056865).
-
A173657: 2+2^n+3^n.
-
A173661: Logarithmic derivative of the squares of the Fibonacci numbers (A007598, with offset).
-
A173673: a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.
-
A173690: Partial sums of round(n^2/5).
-
A173691: Partial sums of round(n^2/6).
-
A173704: Partial sums of floor(n^3/2).
-
A173707: Partial sums of floor(n^3/3).
-
A173711: Nonnegative integers, six even followed by two odd.
-
A173714: Floor(Lucas(n+1)/2), Lucas(n) = A000032(n).
-
A173721: Partial sums of A056833.
-
A173722: Partial sums of round(n^2/8).
-
A173732: a(n) = (A016957(n)/2^A007814(A016957(n)) - 1)/2, with A016957(n) = 6*n+4 and A007814(n) the 2-adic valuation of n.
-
A173734: a(n) = (10^n + 62)/9 for n>0.
-
A173735: a(n) = (10^n + 26)/9.
-
A173736: a(n) = (10^n + 35)/9 for n>0.
-
A173737: (10^n+44)/9 for n>0.
-
A173764: a(n) = (10^n+17)/3.
-
A173766: a(n) = (10^n+11)/3.
-
A173768: a(n) = (4*10^n - 31)/9.
-
A173770: a(n) = (4*10^n - 13)/9.
-
A173772: a(n) = (4*10^n + 23)/9.
-
A173776: a(n) = (4*10^n + 41)/9.
-
A173785: Expansion of 2*(1 -4*x +14*x^2 +4*x^3 +9*x^4)/(1-x)^5.
-
A173802: a(n) = (5*10^n - 23)/9.
-
A173804: a(n) = (5*10^n - 41)/9 for n > 0.
-
A173805: a(n) = (6*10^n - 51)/9 for n > 0.
-
A173806: a(n) = (7*10^n - 61)/9 for n > 0.
-
A173807: a(n) = (7*10^n - 43)/9 for n > 0.
-
A173808: a(n) = (7*10^n + 11)/9 for n > 0.
-
A173809: a(2n+1) = 1+A131941(2n+1). a(2n) = A131941(2n).
-
A173810: a(n) = (8*10^n - 71)/9 for n > 0.
-
A173811: a(n) = (8*10^n - 53)/9 for n > 0.
-
A173812: a(n) = (8*10^n - 17)/9 for n > 0.
-
A173813: 2*(10^n-5), n>0.
-
A173833: a(n) = 10^n - 3.
-
A173834: a(n)=10^n-2*n.
-
A173835: 10^n+2*n.
-
A173856: Expansion of 10/9 in base phi.
-
A173857: Expansion of 3/2 in base phi.
-
A173858: Expansion of 4/3 in base phi.
-
A173861: Expansion of 8/7 in base phi.
-
A173862: a(n) = A158772(n-1)/21.
-
A173864: Expansion of 9/8 in base phi.
-
A173873: a(n) = 2*a(n-1) + 13, a(1)=1.
-
A173952: a(1)=32 and, for n > 1, a(n) = 9*a(n-1) + 32.
-
A173960: Averages of four consecutive odd squares.
-
A173961: Averages of two consecutive even cubes: (n^3+(n+2)^3)/2.
-
A173962: Averages of two consecutive odd cubes; a(n) = (n^3+(n+2)^3)/2.
-
A173963: Number of nonoverlapping placements of one 1 X 1 square and one 2 X 2 square on an n X n board.
-
A173965: Averages of four consecutive cubes.
-
A173974: Numbers k such that k^k+43 is prime.