42293

Properties

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has period 99.at n=35A020438
• a(0) = 1; a(n+1) = a(n) + Sum_{i=0..n} binomial(n,i)*(a(i)+1).at n=8A060719
• Triangle read by rows: T(n,k) = 2 * A011971(n,k) - 1.at n=44A136791
• Triangle read by rows: T(n,k) = 2 * A011971(n,k) - 1.at n=45A136791
• 7^n mod 5^n.at n=7A138648
• Least prime p == -1 (mod n) that divides Fibonacci((p+1)/n), or 0 if no such prime exists.at n=52A168172
• Primes p such that 2*p^5-+3 are also prime.at n=11A174368
• Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=35A253218
• Base numbers of decagonal (10-gonal) palindromic numbers.at n=6A307829
• Consider the graph of symmetric primes where p and q are connected if |p-q| = gcd(p-1,q-1). This sequence is an irregular table where the n-th row lists the first symmetric prime in a connected component with n vertices, with one representative for each nonisomorphic graph. Within a row, graphs are ordered by increasing size of its initial prime.at n=1A358312
• For n >= 1, a(n) is the least prime p such that the arithmetic mean of (n + 1) consecutive primes starting with p is a perfect square, or a(n) = -1 if no such p exists.at n=32A365706
• Triangle read by rows: T(n,k) = number of collections of up to k+1 disjoint subsets of [n] covering [n], with [0]={}, 0<=k<=n.at n=53A381682
• Prime numbersat n=4421