Skip to content

Summary of block A074

144 sequences
  • A074056: a(n)=a(n-1)^3/a(n-2)^2+a(n-1)*a(n-2) with a(1)=a(2)=1.

  • A074065: Numerators a(n) of fractions slowly converging to sqrt(3): let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < sqrt(3), then a(n+1) = a(n) + 1, else a(n+1)= a(n).

  • A074066: Zigzag modulo 3.

  • A074073: Denominators of iterations of Thue-Morse sequence.

  • A074092: Number of plane binary trees of size n+3 and contracted height n.

  • A074099: Duplicate of A006788.

  • A074143: a(1) = 1; a(n) = n * Sum_{k=1..n-1} a(k).

  • A074148: a(n) = n + floor(n^2/2).

  • A074149: Sum of terms in each group in A074147.

  • A074150: Duplicate of A061925.

  • A074183: Duplicate of A039960.

  • A074201: Let b(1) = 1, b(2) = 2, b(n+2) = (b(n+1)+1)/(b(n)+1); then a(n) = 1 if b(n) >= 1 and a(n) = 0 otherwise (also a(n) = floor(b(n)) for n > 2).

  • A074227: Duplicate of A042965.

  • A074231: Numbers n such that Kronecker(8,n) = mu(gcd(8,n)).

  • A074280: Duplicate of A000523.

  • A074323: Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n>=2, nu(n)=b*nu(n-1)+lambda*(n-1)_q*nu(n-2) with (b,lambda)=(1,2), where (n)_q=(1+q+…+q^(n-1)) and q is a root of unity.

  • A074324: a(2n+1) = 3^n, a(2n) = 4*3^(n-1) except for a(0) = 1.

  • A074331: a(n) = Fibonacci(n+1) - (1 + (-1)^n)/2.

  • A074333: a(n+1) = a(n) + (a(n))^3 with a(0)=1.

  • A074335: In music, with 0 = C natural, 1 = C#, etc.: The unfolding of a semitonal interval cycle, alternating the ascending and descending aspects of the cycle from a common point or axis of symmetry. Any regularly occurring alignment may be used, with predictable even or odd results.

  • A074377: Generalized 10-gonal numbers: m*(4*m - 3) for m = 0, +- 1, +- 2, +- 3, …

  • A074378: Even triangular numbers halved.

  • A074386: Numbers k such that sigma(k) is the square of a prime.

  • A074392: a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.

  • A074487: a(1)=1, then “jump over next square”: a(n) = 2*(a(n-1)+1)^2-a(n-1).

  • A074488: a(1)=1, then “jump over next cube”: a(n) = 2*(a(n-1)+1)^3-a(n-1).

  • A074494: Number of 2-input gates used to synthesize parity function in disjunctive normal form (DNF) with n inputs.

  • A074501: a(n) = 1^n + 2^n + 5^n.

  • A074502: a(n) = 1^n + 2^n + 6^n.

  • A074503: a(n) = 1^n + 2^n + 7^n.

  • A074504: a(n) = 1^n + 2^n + 8^n.

  • A074505: a(n) = 1^n + 2^n + 9^n.

  • A074506: a(n) = 1^n + 3^n + 4^n.

  • A074507: a(n) = 1^n + 3^n + 5^n.

  • A074508: a(n) = 1^n + 3^n + 6^n.

  • A074509: a(n) = 1^n + 3^n + 7^n.

  • A074510: a(n) = 1^n + 3^n + 8^n.

  • A074511: a(n) = 1^n + 4^n + 5^n.

  • A074512: a(n) = 1^n + 4^n + 6^n.

  • A074513: a(n) = 1^n + 4^n + 7^n.

  • A074514: 1^n + 4^n + 8^n.

  • A074515: a(n) = 1^n + 4^n + 9^n.

  • A074516: a(n) = 1^n + 5^n + 6^n.

  • A074517: a(n) = 1^n + 5^n + 7^n.

  • A074518: a(n) = 1^n + 5^n + 8^n.

  • A074519: a(n) = 1^n + 5^n + 9^n.

  • A074520: a(n) = 1^n + 6^n + 7^n.

  • A074521: a(n) = 1^n + 6^n + 8^n.

  • A074522: a(n) = 1^n + 6^n + 9^n.

  • A074523: a(n) = 1^n + 7^n + 8^n.

  • A074524: a(n) = 1^n + 7^n + 9^n.

  • A074525: a(n) = 1^n + 8^n + 9^n.

  • A074526: a(n) = 2^n + 3^n + 4^n.

  • A074527: a(n) = 2^n + 3^n + 5^n.

  • A074528: a(n) = 2^n + 3^n + 6^n.

  • A074529: a(n) = 2^n + 3^n + 7^n.

  • A074530: a(n) = 2^n + 3^n + 8^n.

  • A074531: a(n) = 2^n + 3^n + 9^n.

  • A074532: a(n) = 2^n + 4^n + 5^n.

  • A074533: a(n) = 2^n + 4^n + 6^n.

  • A074534: a(n) = 2^n + 4^n + 7^n.

  • A074535: a(n) = 2^n + 4^n + 8^n.

  • A074536: a(n) = 2^n + 4^n + 9^n.

  • A074537: a(n) = 2^n + 5^n + 6^n.

  • A074538: a(n) = 2^n + 5^n + 7^n.

  • A074539: a(n) = 2^n + 5^n + 8^n.

  • A074540: a(n) = 2^n + 5^n + 9^n.

  • A074541: a(n) = 2^n + 6^n + 7^n.

  • A074542: a(n) = 2^n + 6^n + 8^n.

  • A074543: a(n) = 2^n + 6^n + 9^n.

  • A074544: a(n) = 2^n + 7^n + 8^n.

  • A074545: a(n) = 2^n + 7^n + 9^n.

  • A074546: a(n) = 2^n + 8^n + 9^n.

  • A074547: a(n) = 3^n + 4^n + 5^n.

  • A074548: a(n) = 3^n + 4^n + 6^n.

  • A074549: a(n) = 3^n + 4^n + 7^n.

  • A074550: a(n) = 3^n + 4^n + 8^n.

  • A074551: a(n) = 3^n + 4^n + 9^n.

  • A074552: a(n) = 3^n + 5^n + 7^n.

  • A074553: a(n) = 3^n + 5^n + 8^n.

  • A074554: a(n) = 3^n + 5^n + 9^n.

  • A074555: a(n) = 3^n + 6^n + 7^n.

  • A074556: a(n) = 3^n + 6^n + 8^n.

  • A074557: 3^n + 6^n + 9^n.

  • A074558: a(n) = 3^n + 7^n + 8^n.

  • A074559: a(n) = 3^n + 7^n + 9^n.

  • A074560: a(n) = 3^n + 8^n + 9^n.

  • A074561: a(n) = 4^n + 5^n + 6^n.

  • A074562: a(n) = 4^n + 5^n + 7^n.

  • A074563: a(n) = 4^n + 5^n + 8^n.

  • A074564: a(n) = 4^n + 5^n + 9^n.

  • A074565: a(n) = 4^n + 6^n + 7^n.

  • A074566: a(n) = 4^n + 6^n + 8^n.

  • A074567: a(n) = 4^n + 6^n + 9^n.

  • A074568: a(n) = 4^n + 7^n + 8^n.

  • A074569: a(n) = 4^n + 7^n + 9^n.

  • A074570: a(n) = 4^n + 8^n + 9^n.

  • A074571: a(n) = 5^n + 6^n + 7^n.

  • A074572: a(n) = 5^n + 6^n + 8^n.

  • A074573: a(n) = 5^n + 6^n + 9^n.

  • A074574: a(n) = 5^n + 7^n + 8^n.

  • A074575: a(n) = 5^n + 7^n + 9^n.

  • A074576: a(n) = 5^n + 8^n + 9^n.

  • A074577: a(n) = 6^n + 7^n + 8^n.

  • A074578: a(n) = 6^n + 7^n + 9^n.

  • A074579: a(n) = 6^n + 8^n + 9^n.

  • A074580: a(n) = 7^n + 8^n + 9^n.

  • A074600: a(n) = 2^n + 5^n.

  • A074601: a(n) = 2^n + 6^n.

  • A074602: a(n) = 2^n + 7^n.

  • A074603: a(n) = 2^n + 8^n.

  • A074604: a(n) = 2^n + 9^n.

  • A074605: a(n) = 3^n + 4^n.

  • A074606: a(n) = 3^n + 5^n.

  • A074607: a(n) = 3^n + 6^n.

  • A074608: a(n) = 3^n + 7^n.

  • A074609: a(n) = 3^n + 8^n.

  • A074610: a(n) = 3^n + 9^n.

  • A074611: a(n) = 4^n + 5^n.

  • A074612: a(n) = 4^n + 6^n.

  • A074613: a(n) = 4^n + 7^n.

  • A074614: a(n) = 4^n + 9^n.

  • A074615: a(n) = 5^n + 6^n.

  • A074616: a(n) = 5^n + 7^n.

  • A074617: a(n) = 5^n + 8^n.

  • A074618: a(n) = 5^n + 9^n.

  • A074619: a(n) = 6^n + 7^n.

  • A074620: a(n) = 6^n + 8^n.

  • A074621: a(n) = 6^n + 9^n.

  • A074622: a(n) = 7^n + 8^n.

  • A074623: a(n) = 7^n + 9^n.

  • A074624: a(n) = 8^n + 9^n.

  • A074662: a(n) = Fibonacci(n+1)+cos(n*Pi/2).

  • A074677: a(n) = Sum_{i = 0..floor(n/2)} (-1)^(i + floor(n/2)) F(2*i + e), where F = A000045 (Fibonacci numbers) and e = (1-(-1)^n)/2.

  • A074703: a(n) = n^2*a(n-1)+1, a(1)=0.

  • A074742: a(n) = (n^3 + 6n^2 - n + 12)/6.

  • A074764: Numbers of smaller squares into which a square may be dissected.

  • A074777: Integers n such that sigma(phi(n))/n = 1/2.

  • A074805: n mod 19 + 1 (“Golden Number”).

  • A074837: Numbers k such that the penultimate 3 divisors of k sum to k.

  • A074872: Inverse BinomialMean transform of the Fibonacci sequence A000045 (with the initial 0 omitted).

  • A074878: Row sums of triangle in A074829.

  • A074894: Full list of counterexamples for the k=3 version of the malicious apprentice problem.

  • A074992: a(n) = (10^(2*n) + 10^n + 1)/3.