Skip to content

Summary of block A300

20 sequences
  • A300067: Period 6: repeat [0, 0, 0, 1, 2, 2].

  • A300068: A sequence based on the period 6 sequence A300067.

  • A300069: Period 6: repeat [0, 0, 0, 1, 2, 1].

  • A300076: A sequence based on the period 6 sequence A300075.

  • A300292: Numbers k such that k^k + 9 is a prime.

  • A300293: A sequence based on the period 6 sequence A151899.

  • A300361: a(n) = 2^A000325(n).

  • A300402: Smallest integer i such that TREE(i) >= n.

  • A300403: Smallest integer i such that SSCG(i) >= n.

  • A300404: Smallest integer k such that the largest term in the Goodstein sequence starting at k is > n.

  • A300523: a(n) = (5*n + 5)*(5*n + 6)*(5*n + 7)/6.

  • A300559: a(n) = n*(n+1)!/2 + 1.

  • A300576: Number of nights required in the worst case to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle).

  • A300622: Denominators of sequence whose exponential self-convolution yields sequence 1, 2, 3, 5, 7, 11, 13, … (1 with primes).

  • A300659: Product of digits of n!.

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

  • A300763: a(n) = ceiling(n/g^3), where g = (1+sqrt(5))/2 is the golden ratio.

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

  • A300898: Primes p such that p# + 4 is divisible by the next prime after p.

  • A300981: Numbers k such that k^k - 10 is a prime.