Skip to content

Summary of block A019

25 sequences
  • A019274: Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.

  • A019281: Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,3)-perfect numbers.

  • A019298: Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).

  • A019303: “Pascal sweep” for k=2: draw a horizontal line through the 1 at C(k,0) in Pascal’s triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).

  • A019425: Continued fraction for tan(1/2).

  • A019427: Continued fraction for tan(1/4).

  • A019434: Fermat primes: primes of the form 2^(2^k) + 1, for some k >= 0.

  • A019438: Squarefree orders of elements of Mathieu group M_23.

  • A019445: Form a permutation of the positive integers, p_1, p_2, …, such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p_1 + … + p_n.

  • A019446: a(n) = ceiling(n/tau), where tau = (1+sqrt(5))/2.

  • A019471: Maximum number of states needed to accept an n-th order approximation to a language over (0+1)^*, n=1..infinity.

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

  • A019502: Number of simplices in minimal decomposition of an n-cube.

  • A019514: a(n) = (n!)^3 + 1.

  • A019515: a(n) = 1 + 0!*1!*2!*…*n!.

  • A019525: Poincaré series [or Poincare series] for depths of roots in a certain root system.

  • A019527: Poincaré series [or Poincare series] for depths of roots in a certain root system.

  • A019532: Numbers k such that Fibonacci(k) divides k!.

  • A019557: Coordination sequence for G_2 lattice.

  • A019582: a(n) = n*(n - 1)^3/2.

  • A019583: a(n) = n*(n-1)^4/2.

  • A019584: a(n) = n^2*(n-1)^3/4.

  • A019590: Fermat’s Last Theorem: a(n) = 1 if x^n + y^n = z^n has a nontrivial solution in integers, otherwise a(n) = 0.

  • A019677: Expansion of 1/((1-4x)(1-8x)(1-12x)).

  • A019999: Number of similarity classes of descendants created by bisection refinement from an initial n-simplex.