Skip to content

Summary of block A078

71 sequences
  • A078000: Duplicate of A007909.

  • A078008: Expansion of (1 - x)/((1 + x)*(1 - 2*x)).

  • A078010: Expansion of (1-x)/(1 - x - x^2 - 2*x^3).

  • A078014: Expansion of (1-x)/(1-x+2*x^3).

  • A078020: Expansion of (1-x)/(1-x+2*x^2).

  • A078024: Expansion of (1-x)/(1-2*x^2-x^3).

  • A078033: Expansion of (1-x) / (1+x^2+2*x^3).

  • A078039: Expansion of (1 - x)/(1 + x - 2*x^2 + x^3).

  • A078043: Expansion of (1 - x)/(1 + x - x^2 + 2*x^3).

  • A078050: Expansion of (1-x)/(1+x+2*x^2).

  • A078052: Expansion of (1-x)/(1+x+2*x^2+2*x^3).

  • A078057: Expansion of (1+x)/(1-2*x-x^2).

  • A078066: Expansion of (1-x)/(1+2*x+x^2+2*x^3).

  • A078069: Expansion of (1-x)/(1+2*x+2*x^2).

  • A078070: Expansion of (1-x)/(1 + 2*x + 2*x^2 + x^3).

  • A078107: Numbers k such that it is not possible to arrange the numbers from 1 to k in a chain with adjacent links summing to a square.

  • A078112: Coefficients a(n) in the unique expansion sin(1) = Sum[a(n)/n!, n>=1], where a(n) satisfies 0<=a(n)<n.

  • A078113: Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)*abs(2*u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.

  • A078126: Negative determinant of n X n matrix M_{i,j}=1 if i=j or i+j=1 (mod 2).

  • A078135: Numbers which cannot be written as a sum of squares > 1.

  • A078137: Numbers which can be written as sum of squares>1.

  • A078139: Primes which cannot be written as sum of squares>1.

  • A078185: Number of n X n matrices over an alphabet of size 15.

  • A078186: Number of n X n matrices over an alphabet of size 16.

  • A078221: a(1) = 1, a(n+1) > a(n) is the smallest multiple of a(n) using only odd digits.

  • A078303: Generalized Fermat numbers: 6^(2^n) + 1, n >= 0.

  • A078304: Generalized Fermat numbers: 7^(2^n)+1, n >= 0.

  • A078309: Numbers that are congruent to {1, 4, 7} mod 10.

  • A078343: a(0) = -1, a(1) = 2; a(n) = 2*a(n-1) + a(n-2).

  • A078351: Number of n X n matrices over an alphabet of size 17.

  • A078352: Number of n X n matrices over an alphabet of size 18.

  • A078353: Number of n X n matrices over an alphabet of size 19.

  • A078354: Number of n X n matrices over an alphabet of size 20.

  • A078358: Non-oblong numbers: Complement of A002378.

  • A078362: A Chebyshev S-sequence with Diophantine property.

  • A078364: A Chebyshev S-sequence with Diophantine property.

  • A078366: A Chebyshev S-sequence with Diophantine property.

  • A078368: A Chebyshev S-sequence with Diophantine property.

  • A078370: a(n) = 4*(n+1)*n + 5.

  • A078371: a(n) = (2*n+5)*(2*n+1).

  • A078427: Sum of all the decimal digits of numbers from 1 to 10^n.

  • A078469: Number of different compositions of the ladder graph L_n.

  • A078489: a(n)=j such that binomial(n,j)<binomial(n-1,j-2).

  • A078501: a(n) = Sum_{k=1..n^2} A078446(k).

  • A078522: Numbers k such that (k+1)*(2*k+1) is a perfect square.

  • A078588: a(n) = 1 if the integer multiple of phi nearest n is greater than n, otherwise 0, where phi = (1+sqrt(5))/2.

  • A078590: a(1)=1, a(2)=1, a(n)=(2^a(n-1) + 1)/a(n-2).

  • A078608: a(n) = ceiling(2/(2^(1/n)-1)).

  • A078609: Least positive integer x such that 2*x^n>(x+3)^n.

  • A078617: Floor(average of first n squares).

  • A078618: a(n) = floor(average of first n cubes).

  • A078619: Floor(average of first n factorials).

  • A078620: Floor(average of first n Fibonacci numbers).

  • A078633: Smallest number of sticks of length 1 needed to construct n squares with sides of length 1.

  • A078642: Numbers with two representations as the sum of two Fibonacci numbers.

  • A078684: a(n) = 3^floor(n^2/4).

  • A078689: Continued fraction expansion of e^(1/3).

  • A078696: a(n+1)=a(n)+a(n-1) if a(n-1) odd, a(n+1)=a(n)+a(n-1)/2 if a(n-1) even.

  • A078697: Duplicate of A066629.

  • A078700: Number of symmetric ways to lace a shoe that has n pairs of eyelets such that each eyelet has at least one direct connection to the opposite side.

  • A078707: Number of vectors of length n that are symmetric about the middle, where each element is drawn from a set of n distinct elements.

  • A078785: Duplicate of A053016.

  • A078787: a(n) = 101*n + 1.

  • A078796: a(n) = 2*ceiling(n*tau) - ceiling(n*sqrt(5)) where tau=(1+sqrt(5))/2 is the Golden ratio.

  • A078836: a(n) = n*2^(n-6).

  • A078904: a(n) = 4a(n-1) + 3n with a(0) = 0.

  • A078922: a(n) = 11*a(n-1) - a(n-2) with a(1)=1, a(2) = 10.

  • A078941: Flipping burnt pancakes. Maximum number of spatula flips to sort a stack of n pancakes of different sizes, each burnt on one side, so that the smallest ends up on top, …, the largest at the bottom and each has its burnt side down.

  • A078986: Chebyshev T(n,19) polynomial.

  • A078987: Chebyshev U(n,x) polynomial evaluated at x=19.

  • A078988: Chebyshev sequence with Diophantine property.