40108

Appears in sequences

• Numbers k such that prime(k+1) == 1 (mod k).at n=18A105286
• a(n) = a(n-2) + 2*a(n-3), n > 3; with a(0)=0, a(1)=1, a(2)=2, a(3)=0.at n=27A134271
• 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), (0, 1, -1), (1, 0, -1), (1, 1, 0), (1, 1, 1)}.at n=8A150760
• Number of binary strings of length n with equal numbers of 00000 and 00010 substrings.at n=16A164179
• Expansion of g.f. A(x) satisfying A(x) = x + A(A(x))^2 - A(A(x))^3.at n=7A190761
• The distinct values, in order of appearance, of A381087.at n=13A378138
• The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times.at n=19A381087
• The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times.at n=20A381087
• The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times.at n=21A381087
• The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times.at n=22A381087
• The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times.at n=23A381087
• The smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 a total of n times.at n=24A381087
• a(n) = the smallest positive integer that produces a product that contains the digit 2 when multiplied by 2 at most n times, and where a further multiplication by 2 produces a number that does not contain the digit 2. Set a(n) = -1 if no such number exists.at n=24A381183