Summary of block A146
Sequences in block A146
Section titled “Sequences in block A146”-
A146005: a(n) = n*Lucas(n).
-
A146025: Numbers that can be written in bases 2, 3, 4, and 5 using only the digits 0 and 1.
-
A146029: Numbers that can be written from base 2 to base 17 using only the digits 0 to 8 (conjectured to be complete).
-
A146078: Expansion of 1/(1-x*(1-9*x)).
-
A146079: Period 9: repeat 2,4,8,5,4,5,8,4,2.
-
A146080: Expansion of 1/(1-x*(1-10*x)).
-
A146081: First differences of A145980.
-
A146082: a(n) = A146081(n) mod 9.
-
A146083: Expansion of 1/(1 - x*(1 - 11*x)).
-
A146084: Expansion of 1/(1-x(1-12x)).
-
A146086: Number of n-digit numbers with each digit odd where the digits 1 and 3 occur an even number of times.
-
A146135: Positive integers a(n) such that for every integer m==1(mod 4),m>=5, there exists a unique representation of m as a sum of the form a(l)+4a(s).
-
A146160: Period 4: repeat [1, 4, 1, 16].
-
A146161: a(n) is the number of n X n matrices with entries in {1,2,3} such that all adjacent entries (in the same row or column) differ by 1 or -1.
-
A146298: Difference between the cubes and 2*tetrahedral numbers; A000578(n) - 2*A000292(n).
-
A146301: a(n) = (8*n+3)*(8*n+7).
-
A146302: a(n) = (8*n+5)*(8*n+9).
-
A146311: a(n) = cos(2*n*arcsin(sqrt(3))) = (-1)^n*cosh(2*n*arcsinh(sqrt(2))).
-
A146312: a(n) = -cos((2*n-1)*arcsin(sqrt(3)))^2 = -1 + cosh((2*n-1)*arcsinh(sqrt(2)))^2.
-
A146313: a(n) = cosh( (2n - 1)*arcsinh(sqrt(2)) )^2 = 1 - cos( (2n - 1)*arcsin(sqrt(3)) )^2.
-
A146325: Period 3: repeat [1, 4, 1].
-
A146501: Period 6: repeat [4,8,7,5,1,2].
-
A146507: Numbers congruent to {1, 13} mod 42.
-
A146509: Numbers that are congruent to {1, 5} mod 18.
-
A146510: Numbers congruent to {1, 4} mod 15.
-
A146512: Numbers congruent to {1, 3} mod 12.
-
A146523: Binomial transform of A010685.
-
A146528: a(0) = 4; for n >= 1, a(n) = 2^n + 4.
-
A146529: A two level sequence: v(n)=2*(If[n == 0, 0, 2^(n - 1)] + 2); a(n)=If[n == 0, 6, (v[n] + v[n - 1] - 2)].
-
A146534: a(n) = 4*C(2n,n) - 3*0^n.
-
A146535: Numerator of (2*n-1)/3.
-
A146541: Binomial transform of A010688.
-
A146559: Expansion of (1-x)/(1 - 2*x + 2*x^2).
-
A146761: Period 6: repeat [0, 0, 6, 6, 3, 3].
-
A146763: Rank of terms ending in 0 in A061039.
-
A146882: a(n) = 5*(4^(n+1) - 1)/3.
-
A146883: a(n) = 6 * Sum_{m=0..n} 5^m.
-
A146884: a(n) = 7*Sum_{k=0..n} 6^k.
-
A146885: a(n) = 8*Sum_{k=0..n} 7^k.
-
A146890: a(n) is the maximal size of a set of lines in the complex n-dimensional space C^n with the property that all the subtriples of lines are pairwise congruent.
-
A146951: Numbers that are congruent to 0 or 6 mod 10.
-
A146963: a(n) = ((3 + sqrt(7))^n + (3 - sqrt(7))^n)/2.
-
A146964: a(n) = ((4 + sqrt(7))^n + (4 - sqrt(7))^n)/2.
-
A146965: a(n) = 10*a(n-1) - 18*a(n-2) with a(0)=1, a(1)=5.
-
A146968: Brocard’s problem: positive integers n such that n!+1 = m^2.
-
A146983: a(n) = A002531(n)*A002531(n+1).
-
A146994: a(n) = (n+1)^2/4 + (floor((n+5)/6) - 1/4) * ((n+1) mod 2).