Summary of block A129
Sequences in block A129
Section titled “Sequences in block A129”-
A129000: Start with an integer (in this case, 1). First, add 5 or 8 if the integer is odd or even, respectively. Then divide by 2.
-
A129002: a(n) = (n^3 + n^2)*2^n.
-
A129003: a(n) = (n^3 + n^2)*3^n.
-
A129004: a(n) = (n^3 + n^2)*4^n.
-
A129005: a(n) = (n^3 + n^2)*5^n.
-
A129006: a(n) = (n^3 + n^2)*6^n.
-
A129007: (n^3+n^2)*7^n.
-
A129008: a(n) = (n^3 + n^2)*8^n.
-
A129009: a(n) = (n^3 + n^2)*9^n.
-
A129028: A129027(n)/4.
-
A129105: Decimal expansion of 84446888 (see A129106).
-
A129107: Decimal expansion of 42223444 = 84446888/2 (see A129106).
-
A129109: Sums of three consecutive hexagonal numbers.
-
A129111: Sums of three consecutive heptagonal numbers.
-
A129184: Shift operator, right.
-
A129185: Shift operator, left.
-
A129194: a(n) = (n/2)^2*(3 - (-1)^n).
-
A129203: a(n) = numerator(3/(n+1)^3)*(3/2 + (-1)^n/2).
-
A129204: The denominator of 2/n^3.
-
A129266: Duplicate of A129527.
-
A129272: a(n)=(1/2)*(2*b(n+1)-3*b(n)+(1-(-1)^b(n))/2) where b(n)=A073941(n).
-
A129290: Base-3 Fermat numbers: 3^(3^n) + 1.
-
A129291: a(n) = 1 - 3^(3^n) + 9^(3^n).
-
A129326: a(n) = (2*n+1)*(n-1)!.
-
A129337: Maximal possible degree of a Chebyshev-type quadrature formula with n nodes, in the case of the constant weight function on [ -1,1].
-
A129345: a(2n) = A001542(n+1), a(2n+1) = A038761(n+1); a Pellian-related sequence.
-
A129346: a(2n) = A100525(n), a(2n+1) = A001653(n+1); a Pellian-related sequence.
-
A129362: a(n) = Sum_{k=floor((n+1)/2)..n} J(k+1), J(k) = A001045(k).
-
A129370: a(n) = n^2 - (n-1)^2*(1 - (-1)^n)/8.
-
A129393: Row sums of A129392.
-
A129399: Level sums of A129398.
-
A129403: Minimal number of edges in e-free non-deterministic finite automata (NFA) for regular expression c_1?c_2?…c_n?.
-
A129428: Centered 47-gonal numbers.
-
A129527: a(2n) = a(n) + 2n, a(2n+1) = 2n + 1.
-
A129530: a(n) = (1/2)*n*(n-1)*3^(n-1).
-
A129532: 3n(n-1)4^(n-2).
-
A129556: Numbers k such that the k-th centered pentagonal number A005891(k) = (5k^2 + 5k + 2)/2 is a square.
-
A129565: A115359 * A000012 as infinite lower triangular matrices.
-
A129589: a(n) = 2*A000129(n) + A000129(n-1) - n.
-
A129669: Right truncatable primes in base 3 (written in decimal form).
-
A129670: Right truncatable primes in base 4 (written in decimal form).
-
A129696: Antidiagonal sums of triangular array T defined in A014430: T(j,k) = binomial(j+1, k) - 1 for 1 <= k <= j.
-
A129728: a(n) = 2*(n-1) + Fibonacci(n).
-
A129743: a(n) = -(u^n-1)*(v^n-1) with u = 2+sqrt(3), v = 2-sqrt(3).
-
A129744: a(n) = -(u^n-1)*(v^n-1) with u = 1+sqrt(2), v = 1-sqrt(2).
-
A129756: Repetitions of odd numbers four times.
-
A129765: Triangle, (1, 1, 2, 2, 2, …) in every column.
-
A129771: Evil odd numbers.
-
A129787: Ceiling(3^n/n).
-
A129788: a(n) = ceiling(4^n/n).
-
A129789: a(n) = ceiling(5^n/n).
-
A129790: a(n) = ceiling(6^n/n).
-
A129791: a(n) = ceiling(7^n/n).
-
A129792: a(n) = ceiling(8^n/n).
-
A129793: a(n) = ceiling(9^n/n).
-
A129794: a(n) = floor(4^n/n).
-
A129795: a(n) = floor(5^n/n).
-
A129796: a(n) = floor(6^n/n).
-
A129797: a(n) = floor(7^n/n).
-
A129798: a(n) = floor(8^n/n).
-
A129799: a(n) = floor(9^n/n).
-
A129803: Triangular numbers that are the sum of three consecutive triangular numbers.
-
A129819: 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.
-
A129863: Sums of three consecutive pentagonal numbers.
-
A129867: Row sums of triangular array T: T(j,k) = k*(j-k)! for k < j, T(j,k) = 1 for k = j; 1 <= k <= j.
-
A129868: Binary palindromic numbers with only one 0 bit.
-
A129869: Number of positive clusters of type D_n.
-
A129871: A variant of Sylvester’s sequence: a(0)=1 and for n>0, a(n) = (a(0)*a(1)*…*a(n-1)) + 1.
-
A129890: a(n) = (2*n+2)!! - (2*n+1)!!.
-
A129892: Erroneous version of A099321.
-
A129893: a(n) = s!/(s-n)! where s = (n*(n+1)/2)+1.
-
A129905: Expansion of g.f.: (1-x)*(1+2*x)/((1+x)*(1-3*x+x^2)).
-
A129923: a(n) = (n+5)! / 5.
-
A129933: a(n) = (n*(n+1)/2+1)!/n!.
-
A129936: a(n) = (n-2)*(n+3)*(n+2)/6.
-
A129952: Binomial transform of A124625.
-
A129953: First differences of A129952.
-
A129954: Second differences of A129952.
-
A129955: Third differences of A129952.
-
A129957: a(n) = n^3 if n is odd, n^3 + 1 otherwise.
-
A129958: First differences of A129957.
-
A129959: A129957(n) - n*(n-1)/2.
-
A129972: a(n) = 2*floor(log_2(n)) + 1.
-
A129982: Fibonacci numbers sandwiched between 1’s.