Summary of block A090
Sequences in block A090
Section titled “Sequences in block A090”-
A090017: a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=0, a(1)=1.
-
A090018: a(n) = 6*a(n-1) + 3*a(n-2) for n > 2, a(0)=1, a(1)=6.
-
A090019: a(n) = (3*10^n + 2*0^n)/5.
-
A090020: Number of distinct lines through the origin in the n-dimensional lattice of side length 4.
-
A090021: Number of distinct lines through the origin in the n-dimensional lattice of side length 5.
-
A090022: Number of distinct lines through the origin in the n-dimensional lattice of side length 6.
-
A090023: Number of distinct lines through the origin in the n-dimensional lattice of side length 7.
-
A090024: Number of distinct lines through the origin in the n-dimensional lattice of side length 8.
-
A090040: (3*6^n + 2^n)/4.
-
A090041: a(n) = 10*a(n-1) - 20*a(n-2), a(0)=1, a(1)=6.
-
A090042: a(n) = 2*a(n-1) + 11*a(n-2) for n > 1, a(0) = a(1) = 1.
-
A090129: Smallest exponent such that -1 + 3^a(n) is divisible by 2^n.
-
A090131: Expansion of (1+x)/(1 - 2*x + 2*x^2).
-
A090132: Expansion of (1+2*x)/(1+2*x+2*x^2).
-
A090139: a(n) = 10*a(n-1) - 20*a(n-2), a(0)=1,a(1)=5.
-
A090168: Floor( 3n/2 ) - floor( 2n/3 ).
-
A090169: a(n) = floor( 3*n/2 ) + floor( 2*n/3 ).
-
A090193: a(n) = A053838(n) + 1 modulo 3.
-
A090197: a(n) = n^3 + 6*n^2 + 6*n + 1.
-
A090198: a(n) = N(5,n), where N(5,x) is the 5th Narayana polynomial.
-
A090223: Nonnegative integers with doubled multiples of 4.
-
A090239: a(n) = A053838(n) + 2 modulo 3.
-
A090244: a(0) = 1; a(1) = 2; a(n) = { a(n-1) + a(n-2) for n even, a(n-1) - a(n-2) for n odd }.
-
A090245: Maximum numbers of cards that would have no SET in an n-attribute version of the SET card game.
-
A090246: The largest subset of P(Z/3Z)^n that does not contain 3 collinear points.
-
A090281: “Plain Bob Minimus” in bell-ringing is a sequence of permutations p_1=(1,2,3,4), p_2=(2,1,4,3), … which runs through all permutations of {1,2,3,4} with period 24; sequence gives position of bell 1 (the treble bell) in n-th permutation.
-
A090288: a(n) = 2*n^2 + 6*n + 2.
-
A090294: a(n) = K_3(n) = Sum_{k>=0} A090285(3,k)*2^k*binomial(n,k). a(n) = (4*n^3+30*n^2+56*n+15)/3.
-
A090300: a(n) = 14*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 14.
-
A090301: a(n) = 15*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 15.
-
A090305: a(n) = 16*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 16.
-
A090326: Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
-
A090327: Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
-
A090328: Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
-
A090337: Let b(0) = 1, b(n) = b(n-1) + (-1)^(n-1)*b(n-1)/10; sequence gives numerator of b(n).
-
A090381: Expansion of (1+4x+7x^2)/((1-x)^2*(1-x^2)).
-
A090390: Repeatedly multiply (1,0,0) by ([1,2,2],[2,1,2],[2,2,3]); sequence gives leading entry.
-
A090407: a(n) = Sum_{k = 0..n} C(4*n + 1, 4*k).
-
A090408: a(n) = Sum_{k=0..n} binomial(4n+3,4k).
-
A090409: a(n) = (7*8^n + 2*(-1)^n)/9.
-
A090411: Expansion of g.f. (1-x)/(1-16*x).
-
A090415: a(n) = Floor[4*Pi*n/(E)].
-
A090443: a(n) = (n+2)! * (n+1)! * n! / 2.
-
A090444: Fifth column (m=4) of triangle A090441.
-
A090453: Third column (m=4) of array A090452.
-
A090470: Expansion of e.g.f.: 1/((1-4*x)*sqrt(1-2*x)).
-
A090483: Indices of zero in A090482.
-
A090529: a(n) is the smallest positive m such that n <= m!.
-
A090542: Incorrect version of A060462.
-
A090555: Erroneous version of A014573.
-
A090570: Numbers that are congruent to {0, 1} mod 9.
-
A090585: Numerator of (Sum_{k=1..n} k) / (Product_{k=1..n} k).
-
A090588: Number of labeled idempotent groupoids.
-
A090590: (1,1) entry of powers of the orthogonal design shown below.
-
A090591: Expansion of g.f.: 1/(1 - 2*x + 8*x^2).
-
A090596: Duplicate of A018240.
-
A090597: a(n) = - a(n-1) + 5(a(n-2) + a(n-3)) - 2(a(n-4) + a(n-5)) - 8(a(n-6) + a(n-7)).
-
A090599: Number of n-element labeled commutative groupoids with an identity.
-
A090602: Number of n-element labeled groupoids with an identity.
-
A090603: Number of n-element labeled groupoids with a fixed identity.
-
A090616: Exponent of highest power of 4 dividing n!.
-
A090617: Exponent of highest power of 8 dividing n!.
-
A090618: Highest power of 9 dividing n!.
-
A090621: Exponent of highest power of 16 dividing n!.
-
A090638: Duplicate of A073869.
-
A090650: n^(n+6).
-
A090672: a(n) = (n^2-1)*n!/3.
-
A090702: a(n) is the minimal number k such that every binary word of length n can be transformed into a palindrome or an antipalindrome by deleting at most k letters.
-
A090727: a(n) = 16a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 16.
-
A090757: Duplicate of A048739.
-
A090763: a(n) = (3*n+3)!/(3*n!*(2*n+2)!).
-
A090766: Duplicate of A069651.
-
A090771: Numbers that are congruent to {1, 9} mod 10.
-
A090772: Numbers that are congruent to {2, 8} mod 10.
-
A090773: Numbers that are congruent to {4, 6} mod 10.
-
A090809: Coefficient of the irreducible character of S_m indexed by (m-2n+2,2n-2) in the n-th Kronecker power of the representation indexed by (m-2,2).
-
A090816: a(n) = (3*n+1)!/((2*n)! * n!).
-
A090843: Number of nodes on a tree with degree 11 interior nodes and degree 1 boundary nodes.
-
A090860: Number of ways of 4-coloring a map in which there is a central circle surrounded by an annulus divided into n-1 regions. There are n regions in all.
-
A090908: Terms a(k) of A073869 for which a(k) is distinct from a(k-1).
-
A090932: a(n) = n! / 2^floor(n/2).
-
A090964: Permutation of natural numbers generated by 2-rowed array shown below.
-
A090965: a(n) = 8*a(n-1) - 4*a(n-2), where a(0) = 1, a(1) = 4.
-
A090976: a(n) = 100 reduced mod n.
-
A090989: Number of meaningful differential operations of the n-th order on the space R^4.
-
A090991: Number of meaningful differential operations of the n-th order on the space R^6.
-
A090993: Number of meaningful differential operations of the n-th order on the space R^8.