63463

Properties

Appears in sequences

• Convolution of Fibonacci numbers and A014306.at n=23A023614
• Smallest prime > 2n+1 beginning and ending with 2n+1, or 0 if no such prime exists.at n=31A070278
• Smallest prime beginning and ending in 2n+1 or 0 if no such prime exists.at n=31A071234
• Primes of the form a^5 + b^3 with a,b>0.at n=36A100273
• Smallest odd prime base q such that p^3 divides q^(p-1) - 1, where p = prime(n).at n=16A125637
• Primes having only {3, 4, 6} as digits.at n=25A199346
• Numbers of the form 6^j + 7^k, for j and k >= 0.at n=41A226819
• Septic artiads: primes p congruent to 1 mod 14 for which all solutions of the congruence x^3 + x^2 - 2x - 1 == 0 (mod p) are 7th power residues.at n=16A270800
• Number of nX4 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards.at n=12A280855
• 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 299", based on the 5-celled von Neumann neighborhood.at n=30A287537
• a(n)/ceiling(6^(n-7)) is the expected number of rolls of a fair 6-sided die in a game where the player starts at 0, advances the position by the outcome of the die's roll until exactly position n is reached. Positions beyond n are avoided by staying at the last visited position, but counting the rolls.at n=11A331944
• Prime numbers p such that the set of composite numbers in the range [p+1, nextprime(p)-1] has more than one element and all the elements have the same number of divisors.at n=11A332740
• Prime numbersat n=6360