Summary of block A113
Sequences in block A113
Section titled “Sequences in block A113”-
A113022: a(n) = size of union of 2^k (mod 10^n), 0 < k <= 5^n.
-
A113023: Number of terms in A095810 which have n digits.
-
A113047: a(n) = C(3n,n)/(2n+1) mod 3.
-
A113052: Binomial(5n,n)/(4n+1) mod 5.
-
A113070: Expansion of ((1+x)/(1-2x))^2.
-
A113071: Expansion of g.f. ((1+x)/(1-3*x))^2.
-
A113119: Total number of digits in all n-digit nonnegative integers.
-
A113127: Expansion of (1 + x + x^2 + x^3)/(1-x)^2.
-
A113217: Parity of decimal digital root of n.
-
A113224: a(2n) = A002315(n), a(2n+1) = A082639(n+1).
-
A113225: a(2n) = A011900(n), a(2n+1) = A001109(n+1).
-
A113247: Number of permutations pi in S_n such that maj pi and maj pi^(-1) have the same parity where maj is the major index. Equivalently, the number of pi such that maj pi and inv pi have the same parity where inv is the inversion number.
-
A113296: Cumulative product of double factorial A006882.
-
A113311: Expansion of (1+x)^2/(1-x).
-
A113312: Expansion of (1+x)^2/(1-2x^2+x^3).
-
A113405: Expansion of x^3/(1 - 2*x + x^3 - 2*x^4) = x^3/( (1-2*x)*(1+x)*(1-x+x^2) ).
-
A113422: a(n) = floor((5*n^2+1)/3).
-
A113450: Difference between the square root of n-th square triangular number and n-th lambda number given by the recurrence f(n) = 2f(n-1) + f(n-2), f(1) = 1, f(2)= 2.
-
A113459: Least number that begins an arithmetic progression of n numbers with the same prime signature.
-
A113473: n repeated 2^(n-1) times.
-
A113474: a(n) = a(floor(n/2)) + floor(n/2) with a(1) = 1.
-
A113491: The primary sequence of numbers used by contestant Michael Larson to decode the movements of squares on the CBS game show “Press Your Luck” in 1984, winning him exactly $110237 in cash and prizes.
-
A113497: Ascending descending base exponent transform of sequence A000034(n) = 1 + n mod 2.
-
A113523: a(n) = largest composite nonnegative integer <= n.
-
A113531: a(n) = 1 + 2*n + 3*n^2 + 4*n^3 + 5*n^4 + 6*n^5.
-
A113541: Numbers k such that 18*k^2+1 is multiple of 19.
-
A113551: a(n) = product of next n even numbers beginning with n if n is even, otherwise product of next n odd numbers beginning with n.
-
A113606: Binary power sequence: a(n) = a(n-1) + 2^a(n-2).
-
A113637: In the sequence of positive integers subtract 1 from each nonprime number.
-
A113646: a(n) is the smallest composite integer which is >= n.
-
A113655: Reverse blocks of three in the sequence of natural numbers.
-
A113679: Expansion of (1-x-2x^2)/(1-x).
-
A113754: Number of possible squares on an n^2 X n^2 grid.
-
A113763: Non-multiples of 13, or numbers not divisible by 13.
-
A113770: Partial sums of A113311(n)^2.
-
A113778: Invert blocks of four in the sequence of natural numbers.
-
A113790: In each block of 5 consecutive natural numbers, swap first and 2nd and swap 4th and 5th.
-
A113801: Numbers that are congruent to {1, 13} mod 14.
-
A113802: Numbers that are congruent to {2, 12} mod 14.
-
A113803: Numbers that are congruent to {3, 11} mod 14.
-
A113804: Numbers that are congruent to 4 or 10 mod 14.
-
A113805: Numbers that are congruent to {5, 9} mod 14.
-
A113806: Numbers that are congruent to {6, 8} mod 14.
-
A113835: a(n) = a(n-1) + 2^(A007494(n-1)).
-
A113836: a(n) = Sum[2^(A001651(i-1)-1), {i,1,n}].
-
A113848: a(1) = a(2) = 1, a(n+2) = 2*a(n) + a(n+1)^2.
-
A113859: Expansion of (7-14*x+6*x^2)/((1-x)*(2*x^2-4*x+1)); related to the binomial transform of Pell numbers A000129 (see formula and comment for A007070).
-
A113861: a(n) = (1/9)*((6*n - 7)*2^(n-1) - (-1)^n).
-
A113870: a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence formed by k(1)=0 together with the numbers A042963.
-
A113876: a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence formed by k(1)=0 together with the numbers A042964.
-
A113909: Odd numbers which are neither squares nor one less than squares.
-
A113913: Number of distinct prime factors of 3^(3^n)+1.
-
A113931: (RSA-1536)-10^n = prime where RSA-1536 is the 463 decimal digit unfactored RSA challenge number.
-
A113954: Expansion of (1-2x^2)/((1-2x)(1+x)^2).
-
A113959: Where n appears in A093903.
-
A113975: Devil’s Farey: coefficient expansion of a quadratic over quadratic that has 123 roots and a Farey p[1/2]=1 ( correction).
-
A113980: Number of compositions of n with an odd number of 1’s.