Summary of block A103
Sequences in block A103
Section titled “Sequences in block A103”-
A103031: Numbers n such that 6*10^n + 2*R_n + 7 is prime, where R_n = 11…1 is the repunit (A002275) of length n.
-
A103115: a(n) = 6*n*(n-1) - 1.
-
A103127: Numbers congruent to {-1, 1, 3, 5} mod 16.
-
A103128: a(n) = floor(sqrt(2n-1)).
-
A103134: a(n) = Fibonacci(6n+4).
-
A103145: a(n) = (1/6)*(n^3 + 21*n^2 + 74*n + 18).
-
A103177: a(n) = (7*3^n + 2n + 5)/4.
-
A103196: a(n) = (1/9)(2^(n+3)-(-1)^n(3n-1)).
-
A103204: a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.
-
A103207: a(n)=(-1)^floor(n/2)/det(M_n) where M_n is the n X n matrix of terms 1/(i+j)! i and j ranging from 1 to n.
-
A103214: a(n) = 24*n + 1.
-
A103220: a(n) = n*(n+1)*(3*n^2+n-1)/6.
-
A103221: Number of partitions of n into parts 2 and 3.
-
A103290: n*(n-1)*(n^2-n+4)/6.
-
A103303: Complete list of digits used in the counting numbers (in base 10). Also known as the “Arabic numerals”.
-
A103312: A transform of the Jacobsthal numbers.
-
A103326: a(n) = Fibonacci(5n)/Fibonacci(n).
-
A103333: Number of closed walks on the graph of the (7,4) Hamming code.
-
A103334: Number of closed walks of length 2n at any of the nodes of degree 1 on the graph of the (7,4) Hamming code.
-
A103368: Period 6: repeat [1, 1, -1, -1, 0, 0].
-
A103391: “Even” fractal sequence for the natural numbers: Deleting every even-indexed term results in the same sequence.
-
A103424: Expansion of e.g.f.: 1 + sinh(2*x).
-
A103425: a(n) = 3*a(n-1) + a(n-2) - 3*a(n-3).
-
A103434: a(n) = Sum_{i=1..n} Fibonacci(2i)^2.
-
A103435: a(n) = 2^n * Fibonacci(n).
-
A103453: a(n) = 0^n + 3^n - 1.
-
A103454: a(n) = 0^n + 4^n - 1.
-
A103455: a(n) = 0^n + 5^n - 1.
-
A103456: a(n) = 0^n + 10^n - 1.
-
A103457: a(n) = 3^n + 1 - 0^n.
-
A103458: a(n) = 7^n + 1 - 0^n.
-
A103459: a(n) = 8^n + 1 - 0^n.
-
A103460: a(n) = 9^n + 1 - 0^n.
-
A103461: a(n) = (-10)^n + 1 - 0^n.
-
A103469: Number of polyominoes consisting of 3 regular unit n-gons.
-
A103486: a(0)=7, a(1)=11, a(2)=13, a(3)=17; then a(n) = a(n-1)+a(n-3)-a(n-4).
-
A103488: a(n) = 2^(n^2-1).
-
A103505: Denominator in expansion of (1-x)*log(1-x).
-
A103517: Expansion of (1+2*x-x^2)/(1-x)^2.
-
A103519: a(1) = 1, a(n) = Sum_{k=1..n} a(n-1) + k.
-
A103526: a(0) = 3; a(n+1) = 2^a(n) - a(n).
-
A103527: a(0) = 2; a(n+1) = 2^a(n) + a(n).
-
A103532: Number of divisors of 240^n.
-
A103586: a(0)=1, for n > 0: n-th run consists of 2^n-1 copies of n+1.
-
A103609: Fibonacci numbers repeated (cf. A000045).
-
A103623: a(n) = n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.
-
A103627: Let S(n) = {n,1,n}; sequence gives concatenation S(0), S(1), S(2), …
-
A103639: a(n) = Product_{i=1..2*n} (2*i+1).
-
A103644: Expansion of g.f. (3x+1)/((1-3*x)*(1+5*x+9*x^2)).
-
A103743: a(n) = 2^(2^n-1) - 2^n - 1.
-
A103747: Trajectory of 2 under repeated application of the map n -> A102370(n).
-
A103770: A weighted tribonacci sequence, (1,3,9).
-
A103772: Larger of two sides in a (k,k,k-1)-integer-sided triangle with integer area.
-
A103815: a(n) = -1 + Product_{k=1..n} Fibonacci(k).
-
A103819: Whitney transform of Jacobsthal numbers.
-
A103820: Whitney transform of 3^n.
-
A103831: For even n, a(n) = n*(n+1), for odd n, a(n) = 2*n + 1.
-
A103845: Product of first n Lucas numbers, plus one.
-
A103850: Primes with digits not in all previous terms.
-
A103897: a(n) = 3*2^(n-1)*(2^n-1).
-
A103901: Mersenne primes p such that M(p) = 2^p - 1 is also a (Mersenne) prime.
-
A103947: a(n) is the number of distinct n-th powers of functions {1, 2} -> {1, 2}.
-
A103969: Positions n such that A005941(n) = A005940(n).
-
A103974: Smaller sides (a) in (a,a,a+1)-integer triangle with integer area.
-
A103975: Smaller side in (a,a+1,a+1)-integer triangle with integer area.