82943

Appears in sequences

• a(n) = n*12^n - 1.at n=3A064758
• Numbers n such that core(n)=floor(sqrt(n)), where core(x)=A007913(x) is the squarefree part of x and floor(sqrt(x))=A000196(x).at n=21A069186
• Distance from n!+1 to next larger square.at n=12A082995
• Sum of three edges of box having both integral orthogonal sides and integral geodesic distances between opposite vertices.at n=6A095257
• a(1)=2. For n >= 2, a(n) = a(n-1) + 1 + (the largest prime among the first n-1 terms of the sequence {a(k)}).at n=20A133489
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 1, 0), (0, 0, -1), (1, 0, 1)}.at n=10A149235
• a(n) = 64*n^2 - 1.at n=35A158684
• Record numbers of A171063 nonzero period n solutions of x(i)=(x(i-1)+x(i-2)) mod m, as encountered in (n=1,m=1; n=1,m=2; n=2,m=1) antidiagonal order.at n=30A171061
• Record numbers of A171063 nonzero period n solutions of x(i)=(x(i-1)+x(i-2)) mod m, as encountered in (n=1,m=1; n=2,m=1; n=1,m=2) antidiagonal order.at n=31A171062
• a(n) = (n^2-1)^2-1.at n=17A178392
• a(n) = 4*12^n - 1.at n=4A199106
• Numbers such that the minimum distance between divisors of n occurs only between composite numbers.at n=2A253266
• a(n) = n*(n+1)*(7*n+2)/6.at n=41A255211
• a(n) is the smallest number m such that tau(m+1) = tau(m) + n.at n=43A343018
• Number of odd-length twice-partitions of n into partitions with all odd parts.at n=25A358823
• The five digits of a(n) and their four successive absolute first differences are all distinct.at n=64A365257
• Numbers k such that k and k+1 are both terms in A377732.at n=30A377733