Skip to content

Summary of block A073

51 sequences
  • A073015: a(n) is such that 2 = sqrt(1+sqrt(1+sqrt(1+…sqrt(a(n))…))) where there are n sqrt’s.

  • A073080: 3 appears three times, 2*3=6 appears six times, 2*6=12 appears twelve times etc.

  • A073089: a(n) = (1/2)*(4n - 3 - Sum_{k=1..n} A007400(k)).

  • A073096: Maximal element in continued fraction for s(n) = sum( k>=n,1/2^(2^k) ).

  • A073113: a(n) = 2^(2^n + n).

  • A073117: a(n+1) = a(n) + a(n) mod n; a(1) = 1.

  • A073143: Numbers k such that A073142(n) = f^k(A073142(n)), where f: m -> |m - reverse(m)|.

  • A073188: n appears 1+[n/3] times.

  • A073225: a(n) = ceiling(n^n/n!).

  • A073260: Length of FixedPointList leading to value of [10^n]-th composite number.

  • A073396: The number n equals the product of two numbers: sums of prime factors of n, with and without repetition.

  • A073455: Numbers n such that to phi(n) = pi(n)-1.

  • A073473: Primes (including 1) forming 3 X 3 magic square with prime entries and minimal constant 111 = A073502(3).

  • A073548: Number of Fibonacci numbers F(k), k <= 10^n, which end in 2.

  • A073549: Number of Fibonacci numbers F(k), k <= 10^n, which end in 6.

  • A073550: Number of Fibonacci numbers F(k), k <= 10^n, which end in 1.

  • A073551: Number of Fibonacci numbers F(k), k <= 10^n, which end in 3.

  • A073552: Duplicate of A067275.

  • A073553: Number of Fibonacci numbers F(k), k <= 10^n, which end in 5.

  • A073554: Number of Fibonacci numbers F(k), k <= 10^n, which end in 7.

  • A073555: Number of Fibonacci numbers F(k), k <= 10^n, which end in 8.

  • A073556: Number of Fibonacci numbers F(k), k <= 10^n, which end in 9.

  • A073577: a(n) = 4*n^2 + 4*n - 1.

  • A073581: Factorials successively exponentiated.

  • A073587: a(n) = a(n-1)*2^n + 1 where a(0)=1.

  • A073588: a(n) = a(n-1)*2^n-1 with a(1)=1.

  • A073589: a(n)=a(n-1)^2*2^n-1 where a(0)=1.

  • A073591: a(n) = A000522(n) + 1.

  • A073636: Period 3: repeat [1, 8, 9] ; Digital root of A000578(n) = n^3 for n >= 1.

  • A073657: A073656 is the rearrangement of Fibonacci numbers such that sum of two consecutive terms is a prime. This is the sequence of those Fibonacci numbers which retain their relative position in the above rearrangement.

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

  • A073720: Let b(1) = 1, b(k+1) = b(k) - k*trunc(k/b(k)+1), where trunc(x) = floor(x) if x>= 0, trunc(x) = ceiling(x) otherwise. Sequence a(n) gives the successive absolute values taken by b(k).

  • A073724: a(n) = (4^(n+1) + 6n + 5)/9.

  • A073750: Factors of 2 in the denominators of the fractional coefficients of the square-root of the prime power series: sum_{n=0..inf} p_n x^n, where p_n is the n-th prime and p_0 is defined to be 1.

  • A073760: Integers m such that A073758(m) = 4.

  • A073762: a(n) = 24*n - 12.

  • A073763: Least number of unrelated set belonging to these numbers is odd.

  • A073769: Duplicate of A008937.

  • A073795: Replace 8^k with (-8)^k in base 8 expansion of n.

  • A073796: Replace 9^k with (-9)^k in base 9 expansion of n.

  • A073825: Numbers n such that Sum_{k=1..n} k^k is prime.

  • A073827: Numbers n such that 1 + 0!*1!*2!*…*n! is prime.

  • A073829: a(n) = 4*((n-1)! + 1) + n.

  • A073833: Numerators of b(n) where b(1) = 1, b(i) = b(i-1) + 1/b(i-1).

  • A073835: Replace 10^k with (-10)^k in decimal expansion of n.

  • A073859: a(1)=1 and a(n>1)=min{primes up to n-1 | a(1)+a(2)+…+a(n-1)+a(n) is a cube}.

  • A073869: a(n) = Sum_{i=0..n} A002251(i)/(n+1).

  • A073921: Odd numbers which retain their position in the rearrangement of A073920: terms of A073920 for which a(n) = 2n-1.

  • A073926: Powers of 2 rearranged so that every partial sum after 1 is a proper prime power.

  • A073940: Number of n X n matrices over an alphabet of size 14.

  • A073941: a(n) = ceiling((Sum_{k=1..n-1} a(k)) / 2) for n >= 2 starting with a(1) = 1.