Skip to content

Summary of block A095

49 sequences
  • A095002: a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 3, a(3) = 19.

  • A095003: a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3).

  • A095004: a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 10, a(3) = 81.

  • A095029: An example of a (v,k,lambda)=(21,5,1) cyclic difference set.

  • A095031: An example of a (v,k,lambda)=(15,7,3) cyclic difference set.

  • A095033: An example of a (v,k,lambda)=(19,9,4) cyclic difference set.

  • A095037: An example of a (v,k,lambda)=(23,11,5) cyclic difference set.

  • A095042: One of two (v,k,lambda)=(31,15,7) cyclic difference sets. The other one is A095041.

  • A095097: Erroneous version of A101345.

  • A095098: Fib001 numbers: those k for which the Zeckendorf expansion A014417(k) ends with two zeros and a final one.

  • A095099: Duplicate of A134860.

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

  • A095122: a(n) = Fibonacci(n)*(2*Fibonacci(n)-1).

  • A095129: Jac(n)(2Jac(n)-1).

  • A095130: Expansion of (x+x^2)/(1-x^6); period 6: repeat [0, 1, 1, 0, 0, 0].

  • A095151: a(n+3) = 3*a(n+2) - 2*a(n+1) + 1 with a(0)=0, a(1)=2.

  • A095166: Group the natural numbers >= 1 so that the n-th group contains n(n+1)/2 numbers and obtain the group sum.

  • A095190: Doubled Thue-Morse sequence: a(2n) = A010060(n), a(2n+1) = A010060(n).

  • A095250: a(n) = 11111111… (n times) = (10^n-1)/9 reduced mod n.

  • A095264: a(n) = 2^(n+2) - 3*n - 4.

  • A095265: A sequence generated from a 4th degree Pascal’s Triangle polynomial.

  • A095311: 47-gonal numbers.

  • A095338: Total number of leaves in the labeled graphs of order n.

  • A095340: Total number of nodes in all labeled graphs on n nodes.

  • A095342: Number of elements in n-th string generated by a Kolakoski(5,1) rule starting with a(1)=1.

  • A095343: Length of n-th string generated by a Kolakoski(7,1) rule starting with a(1)=1.

  • A095344: Length of n-th string generated by a Kolakoski(9,1) rule starting with a(1)=1.

  • A095351: Total number of edges in all labeled graphs on n nodes.

  • A095372: 1+integers repeating “90” decimal digit pattern.

  • A095687: Numbers n such that n-th Pisano number = 6*n.

  • A095752: a(n) = (1/9)*(-1+10^n)*(4*n+3).

  • A095761: a(n) = A014824(2*n-1).

  • A095764: Numbers whose name in English contains an “l”.

  • A095768: a(n) = 2^(n+1) - n.

  • A095791: Number of digits in lazy-Fibonacci-binary representation of n (A104326).

  • A095794: a(n) = A005449(n) - 1, where A005449 = second pentagonal numbers.

  • A095861: Number of primitive Pythagorean triangles of form (X,Y,Y+1) with hypotenuse Y+1 less than or equal to n.

  • A095894: a(2n) = 6*n^2 + 7*n + 1; a(2n+1) = 6*n^2 + 13*n + 7.

  • A095898: The (1,1)-term of the 3 X 3 matrix M^n, where M = [1,2,3 / 4,7,11 / 6,10,16].

  • A095905: Sequence generated from Golomb’s proof of de Bruijn’s theorem on a torus considered as a matrix.

  • A095915: Each number is twice times the product of the digits of the previous number.

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

  • A095937: a(n) = Sum_{k=0..n} (k-1)^k.

  • A095939: a(n+2) = 5a(n+1) - 3a(n) (n >= 1); a(0) = 1, a(1) = 2, a(2) = 9.

  • A095940: a(n+2) = 5*a(n+1) - 3*a(n) (n >= 1); a(0) = 0, a(1) = 1, a(2) = 4.

  • A095948: Positions of vowels in English alphabet.

  • A095949: Position of consonants in English alphabet.

  • A095956: a(n) is the smallest initial value if function f(x)=phi(sigma(x)) is iterated and the iteration ends in a cycle of length n.

  • A095998: n! * (fractional part of n-th harmonic number).