40959

Appears in sequences

• Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m).at n=11A000236
• a(n) = 2*a(n-2) + 1.at n=26A010737
• Denominators of continued fraction convergents to sqrt(481).at n=11A041919
• Numbers having four 7's in base 8.at n=36A043452
• a(n) = 5*2^(n-1) - 1, n>0, with a(0)=1.at n=14A052549
• a(n) = T(n,1), array T as in A054134.at n=14A054135
• Numbers k such that (34*10^(k-1) - 43)/9 is a plateau prime.at n=14A082708
• a(n) = Sum_{k=0..n} binomial(n+(-1)^k, k).at n=14A087940
• a(n) = (3^(2*n))*(integral_{x=0 to 1} (1+x^3)^n dx)/(integral_{x=0 to 1} (1-x^3)^n dx).at n=4A089138
• Divisors of 10^15 - 1.at n=37A111117
• a(n) = 5*2^n - 1.at n=13A153894
• a(n) = 40*n^2 - 1.at n=31A158598
• Numbers m with property that m-th triangular number is a sum of divisors of some k-th triangular number (A175849).at n=16A175850
• a(n) = 10*8^n - 1.at n=4A198857
• a(n) is the smallest k > 0 such that the first n multiples of k have the same sum of digits, but (n+1)k has a different one. a(n)=0 if no such k exists.at n=29A238088
• a(n) is the least integer m > 1 such that n is the largest number of identical digits that can end m^k for positive integer k.at n=12A244364
• Record values in A135141.at n=28A246347
• Number of (n+3)X(2+3) 0..1 arrays with each row and column divisible by 11, read as a binary number with top and left being the most significant bits.at n=10A262237
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=30A287858
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 387", based on the 5-celled von Neumann neighborhood.at n=17A287955