Summary of block A141
Sequences in block A141
Section titled “Sequences in block A141”-
A141012: a(0) = 0, a(n) = 13^(n-1) + 1.
-
A141023: a(n) = 2^n - (3-(-1)^n)/2.
-
A141025: a(n) = (2^(2+n)-(-1)^n)/3 - 2*n.
-
A141032: a(n) = 4*(16^n-1)/15.
-
A141041: a(n) = ((3 + 2*sqrt(3))^n + (3 - 2*sqrt(3))^n)/2.
-
A141044: Two 2’s followed by all 1’s.
-
A141046: a(n) = 4*n^4.
-
A141054: 8-idempotent numbers: a(n) = binomial(n+8,8)*8^n.
-
A141060: Fourth quadrisection of Jacobsthal numbers A001045: a(n)=16a(n-1)-5.
-
A141104: Lower Even Swappage of Upper Wythoff Sequence.
-
A141105: Upper Even Swappage of Upper Wythoff Sequence.
-
A141106: Lower Odd Swappage of Upper Wythoff Sequence.
-
A141107: Upper Odd Swappage of Upper Wythoff Sequence.
-
A141125: Hankel transform of a transform of Fibonacci numbers.
-
A141212: a(n) = 1, if n == {1,3,4} mod 6; otherwise 0.
-
A141213: Defining A to be the interior angle of a regular polygon, the number of constructible regular polygons such that A is in a field extension = degree 2^n, starting with n=0. This is also the number of values of x such that phi(x)/2 = 2^n (where phi is Euler’s phi function), also starting with n=0.
-
A141222: Expansion of -1/(2*x) + (2*x-1)^2/(2*x*(1-4x)^(3/2)).
-
A141259: a(n) == {0,1,3,4,5,7,9,11} mod 12; n>0.
-
A141260: a(n) = 1 if n == {0,1,3,4,5,7,9,11} mod 12, otherwise a(n) = 0.
-
A141291: a(n) = 4*a(n-1) + 2*n - 1.
-
A141310: The odd numbers interlaced with the constant-2 sequence.
-
A141317: a(n) = A000244(n) - A010684(n).
-
A141325: a(n) = A000045(n) + A131531(n+3).
-
A141326: Subsequence of ‘Fermat near misses’ which is generated by a simple formula based on the cubic binomial expansion along with formulas for the corresponding terms in the expression, x^3 + y^3 = z^3 + 1.
-
A141341: Totally Goldbach numbers: Positive integers k such that for all primes p < k-1 with p not dividing k, k-p is prime.
-
A141351: a(n) = C(n) + 1 - 0^n where C(n) = A000108(n).
-
A141353: a(n) = Catalan(n) + 2^n - 0^n.
-
A141354: Expansion of (1-5*x-x^2+x^3)/((1+x)*(1-x)^3).
-
A141355: The Jacobsthal sequence, dropping each third term.
-
A141364: a(n) = C(n)-1+0^n where C(n) = A000108(n).
-
A141397: a(n) = 3*a(n-1) + A001651(n+1).
-
A141407: a(n) = binomial(n+7,7)*6^n.
-
A141413: Inverse binomial transform of A140962.
-
A141415: Number of different virtual strings with n crossings.
-
A141425: Period 6: repeat [1, 2, 4, 5, 7, 8].
-
A141478: a(n) = binomial(n+2,3)*4^3.
-
A141518: Period 5: repeat [1, 3, 5, 7, 9].
-
A141530: a(n) = 4*n^3 - 6*n^2 + 1.
-
A141531: Inverse binomial transform of A001651.
-
A141571: Decimal expansion of 11999/99900.
-
A141631: a(n) = 3*n^2 - 4*n + 3.
-
A141683: a(n) = Sum_{k=1..n} b(k)*a(n - k) for n >= 1, where b(n) = b(n-2) + b(n-3) for n >= 3 with b(0) = 0 and b(1) = b(2) = 1.
-
A141694: a(n) = 22*n + 12.
-
A141722: a(n) = 8*4^n - 7.
-
A141725: a(n) = 4^(n+1) - 3.
-
A141726: Sawtooth with period length 9: repeat 8, 7, 6, 5, 4, 3, 2, 1, 0.
-
A141742: Starting from the 1 in the first line of triangle A141728 choose one of the three digits below it. Repeat down to the other rows. Sequence gives the numbers in base 10 expressed by the collected digits that cannot be reached following any possible path.
-
A141752: a(n) = Sum_{k=0..n} ( Fibonacci(2*k-1) + (n-k)*Fibonacci(2*k) ).
-
A141759: a(n) = 16n^2 + 32n + 15.
-
A141775: Binomial transform of (1, 2, 0, 1, 2, 0, 1, 2, 0, …).
-
A141827: a(n) = (n^3*a(n-1) - 1)/(n - 1) for n >= 2, with a(0) = 1, a(1) = 4.
-
A141834: Sum of the lengths of the cycles at a vertex of the complete graph K_n.