Summary of block A076
Sequences in block A076
Section titled “Sequences in block A076”-
A076008: Second column of triangle A075504.
-
A076024: a(n) = (2^n + 4)*(2^n - 1)/6.
-
A076032: Duplicate of A004277.
-
A076040: a(n) = (-1)^n * (3^n - 1)/2.
-
A076046: Ramanujan-Nagell numbers: the triangular numbers (of the form a*(a+1)/2) which are also of the form 2^b - 1.
-
A076049: Numbers k such that the sum of the k-th triangular number and (k+2)-nd triangular number is a triangular number.
-
A076118: a(n) = Sum_{k=n/2..n} k * (-1)^(n-k) * C(k,n-k).
-
A076127: n-th term is binary string of length t_n with 1’s at positions t_i, where t_n = n-th triangular number.
-
A076128: Difference between the product of numbers up to n and the sum of numbers up to n.
-
A076131: a(n) = 2^n*a(n-1) + 1, a(0) = 0.
-
A076139: Triangular numbers that are one-third of another triangular number: T(m) such that 3*T(m) = T(k) for some k.
-
A076140: Triangular numbers T(k) that are three times another triangular number: T(k) such that T(k) = 3*T(m) for some m.
-
A076148: Let b(1)=x, b(2)=y, k*b(k)=(2k-1)*b(k-1) + 3(k+1)*b(k-2); then b(n)=a(n)*x+c(n)/3*y.
-
A076202: Erroneous version of A000598.
-
A076226: Numbers m such that the largest of the most frequent values in m-th row of A076221 is different from m-1.
-
A076301: Related to number of labeled partially ordered sets.
-
A076313: a(n) = floor(n/10) - (n mod 10).
-
A076314: a(n) = floor(n/10) + (n mod 10).
-
A076338: a(n) = 512*n + 1.
-
A076448: Numbers one more than a power of 2 which are the sum of n consecutive numbers one more than a power of 2.
-
A076454: Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly one way.
-
A076455: Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly two ways.
-
A076506: Expansion of x*(1+3*x+12*x^2)/(1-24*x^3).
-
A076508: Expansion of 2*x*(1+4*x+8*x^2)/(1-24*x^3).
-
A076538: Numerators a(n) of fractions slowly converging to e: let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < e then a(n+1) = a(n) + 1, else a(n+1)= a(n).
-
A076539: Numerators a(n) of fractions slowly converging to Pi: let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < Pi, then a(n+1) = a(n) + 1, otherwise a(n+1) = a(n).
-
A076599: Numbers n such that A068340(n) = +-10.
-
A076628: a(n) = 2^(2^(n-1))*b(n) where b(1) = 1/2 and b(n+1) = b(n) - b(n)^2.
-
A076662: First differences of A007066.
-
A076684: Odd terms in A027941.
-
A076688: a(n) = 2^(2^n-n-2).
-
A076708: Numbers n such that triangular numbers T(n) and T(n+1) sum to another triangular number (that is also a perfect square).
-
A076715: Duplicate of A029549.
-
A076728: a(n) = (n-1)^2 * n^(n-2).
-
A076729: a(n) = A001147(n+1) * Integral_{x=0..1} (1 + x^2)^n dx.
-
A076736: Let u(1) = u(2) = u(3) = 2, u(n) = (1 + u(n-1)*u(n-2))/u(n-3); then a(n) is the denominator of u(n).
-
A076738: Expansion of (1+2*x+6*x^2)/(1-9*x^3).
-
A076765: Partial sums of Chebyshev sequence S(n,8) = U(n,4) = A001090(n+1).
-
A076767: Triangular numbers with square pyramidal indices.
-
A076770: Even numbers representable as the sum of two odd composites.
-
A076781: a(n) = 6^(n^2).
-
A076782: a(n) = 10^(n^2).
-
A076783: a(n) = 11^(n^2).
-
A076795: Partial sums of (2n-1)!!.
-
A076807: Number of n X n matrices over an alphabet of size 12.
-
A076811: Number of n X n matrices over an alphabet of size 13.
-
A076824: Let a(1)=a(2)=1, a(n)=(2^ceiling(a(n-1)/2)+1)/a(n-2).
-
A076826: a(n) = 2*(Sum_{k=0..n} A010060(k)) - n, where A010060 is a Thue-Morse sequence.
-
A076839: A simple example of the Lyness 5-cycle: a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2).
-
A076840: a(1) = a(2) = 1; a(n) = (a(n-1) + 1)/a(n-2) (for n>2, n odd), (a(n-1)^2 + 1)/a(n-2) (for n>2, n even).
-
A076852: Number of geometries for group A_n under axioms A, 2T_1.
-
A076854: Number of geometries for group A_n under axioms A, NT.
-
A076856: Number of geometries for group A_n under axioms A, 2T_1, CD, NT.
-
A076857: Number of geometries for group S_n under axioms A.
-
A076858: Number of geometries for group S_n under axioms A, 2T_1.
-
A076859: Number of geometries for group S_n under axioms A, CD.
-
A076860: Number of geometries for group S_n under axioms A, NT.
-
A076861: Number of geometries for group S_n under axioms A, 2T_1, CD.
-
A076862: Number of geometries for group S_n under axioms A, 2T_1, CD, NT.
-
A076877: a(n) = A020330(n) / n.
-
A076878: a(n) = ceiling(n^(1/n))^n - n.
-
A076883: Let u(0)=1, u(n) = 5/2 * floor(u(n-1)); then a(n) = (2/5)*u(n).
-
A076921: Smallest number such that the highest common factor of pair of successive terms follows the pattern 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, …, i.e., b(2n-1) = b(2n) = n given by A004526.
-
A076936: a(1) = 1; then the smallest number different from its predecessor such that the n-th partial product is an n-th power.
-
A076937: Duplicate of A014682.
-
A076938: Duplicate of A004526.
-
A076939: Duplicate of A016116.