67650

Appears in sequences

• Fibonacci sequence beginning 0, 10.at n=20A022093
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,51.at n=19A064262
• Reduced binary string self-substitutions: a(n) is obtained by substituting n for each 1-bit in the binary expansion of n, then dividing by n.at n=29A065160
• First differences of (n+1)^5-n^5.at n=14A068236
• Smallest positive integer which when written in base n is doubled when the last digit is put first.at n=13A087502
• a(1)=1; thereafter, a(n+1) = 20*n^3 + 10*n.at n=15A101098
• Number of cases in which the first player is killed in a Russian roulette game where 5 players use a gun with n chambers and the number of bullets can be from 1 to n. Players do not rotate the cylinder after the game starts.at n=16A119610
• Numbers k such that 2k+1, 4k+1, 6k+1 and 8k+1 are primes.at n=34A124409
• Row sums of A128619.at n=19A128620
• a(n) = A010696(n-1) * A086892(n).at n=39A141498
• Least number m, written in base 10, such that m/2 is obtained merely by shifting the leftmost digit of m to the right end, and 2m by shifting the rightmost digit of m to the left end, digits defined in base n.at n=13A147514
• Number of permutations of floor(i*5/4), i=0..n-1, with all sums of two adjacent terms unique.at n=8A147886
• a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.at n=20A153382
• Self-composition of binary encoding of GF(2) polynomial.at n=30A193145
• a(n) = (Product_{i=1..n-1} (2^i + 1)) modulo (2^n - 1).at n=19A219732
• Composite numbers n such that n | A072514 (n).at n=18A237878
• Number of partitions p of n such that (number of numbers of the form 5k + 4 in p) is a part of p.at n=47A241553
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 589", based on the 5-celled von Neumann neighborhood.at n=40A273113
• Number of forests of labeled rooted trees of height at most 1, with n labels, two of which are used for root nodes and any root may contain >= 1 labels.at n=10A273652
• Number of 3-cycles in the n X n black bishop graph.at n=30A289161