Skip to content

Summary of block A072

53 sequences
  • A072025: a(n) = n^4 + 2*n^3 + 4*n^2 + 3*n + 1 = ((n+1)^5+n^5) / (2*n+1).

  • A072110: a(n) = 4*a(n-1) - a(n-2) - 2, with a(0)=1, a(1)=2.

  • A072130: a(n+1) - 3*a(n) + a(n-1) = (2/3)*(1+w^(n+1)+w^(2*n+2)); a(1) = 0, a(2) = 1; where w is the cubic root of unity.

  • A072154: Coordination sequence for the planar net 4.6.12.

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

  • A072173: a(n) = (2*n+1)*239^(2*n+1).

  • A072174: Maximum path length of a crippled knight on an n X n board.

  • A072175: a(1)=1, a(2)=2, a(n) = a(n-1) + 1 - 2*sign(a(n-2)) for n>2.

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

  • A072196: Multiples of 3 which on one operation of the Collatz function T (N -> 3N+1/2^r) yield the number 5.

  • A072197: a(n) = 4*a(n-1) + 1 with a(0) = 3.

  • A072201: a(n) = 4*a(n-1) + 1, a(1) = 15.

  • A072221: a(n) = 6*a(n-1) - a(n-2) + 2, with a(0)=1, a(1)=4.

  • A072230: a(n) = n! (mod n^2), that is, n factorial modulo n^2.

  • A072246: Numbers which are simultaneously the number of partitions of some k and the number of distinct partitions of some m.

  • A072249: Related to lollipop graphs.

  • A072256: a(n) = 10*a(n-1) - a(n-2) for n > 1, a(0) = a(1) = 1.

  • A072258: a(n) = ((6*n+1)*4^n - 1)/3.

  • A072259: a(n) = ((6*n+37)*4^n - 1)/3.

  • A072260: a(n) = ((6*n+19)*4^n - 1)/3.

  • A072261: a(n) = 4*a(n-1) + 1, a(1)=7.

  • A072262: a(n) = 4*a(n-1) + 1, a(1)=11.

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

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

  • A072265: Variant of Lucas numbers: a(n) = a(n-1) + 4*a(n-2) starting with a(0)=2 and a(1)=1.

  • A072277: Smallest integer > 1 which is both n-gonal and centered n-gonal.

  • A072290: Number of digits in the decimal expansion of the Champernowne constant that must be scanned to encounter all n-digit strings.

  • A072335: Expansion of 1/((1-x^2)*(1-4*x+x^2)).

  • A072345: Volume of n-dimensional sphere of radius r is V_n*r^n = Pi^(n/2)*r^n/(n/2)! = C_n*Pi^floor(n/2)*r^n; sequence gives numerator of C_n.

  • A072376: a(n) = a(floor(n/2)) + a(floor(n/4)) + a(floor(n/8)) + … starting with a(0)=0 and a(1)=1.

  • A072418: Parity of floor(3^n/2^n).

  • A072442: Least k such that Sum_{i=1..k} cos(1/sqrt(i)) > n.

  • A072493: a(1) = 1 and a(n) = ceiling((Sum_{k=1..n-1} a(k))/3) for n >= 2.

  • A072540: Numbers that are not differences between successive Ulam numbers (A002858).

  • A072561: Denominators of w(n) equals 3 where w(1)=w(2)=w(3)=1, w(n)=(w(n-1)*w(n-2)+(w(n-1)+w(n-2))/3) / w(n-3).

  • A072606: Number of pretzel (stellar or prismatic) knots and links.

  • A072615: Duplicate of A020871.

  • A072633: Smallest positive integer m where 1^n+2^n+3^n+…+m^n is greater than or equal to (m+1)^n.

  • A072638: Number of unary-binary rooted trees of height at most n.

  • A072639: a(0) = 0, a(n) = Sum_{i=0..n-1} 2^((2^i)-1).

  • A072649: n occurs Fibonacci(n) times (cf. A000045).

  • A072665: Center of smallest run of 2n+1 consecutive numbers with exactly n+1,n,…,2,1,2,…,n,n+1 distinct prime factors, respectively.

  • A072674: a(n) = 3^n+2*2^n-3.

  • A072703: Indices of Fibonacci numbers whose last digit is 5.

  • A072725: Integers which are exactly the concatenation of the first m numbers (A007908) divided by their sum (A000217 = m*(m+1)/2).

  • A072819: Variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -n for the first time.

  • A072833: Numbers that are congruent to 0, 5, 8, 9 mod 12.

  • A072842: Largest m such that we can partition the set {1,2,…,m} into n subsets with the property that we never have a+b=c for any distinct elements a, b, c in one subset.

  • A072863: a(n) = 2^(n-3)*(n^2+3*n+8).

  • A072912: Number of Fibonacci numbers F(k) <= 10^n which end in 0.

  • A072946: 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)=(2,2), where (n)_q=(1+q+…+q^(n-1)) and q is a root of unity.

  • A072975: a(n) = 2^n*binomial(3*n,n)*(3*n+1).

  • A072996: 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)=(2,1), where (n)_q=(1+q+…+q^(n-1)) and q is a root of unity.