34211

Properties

Appears in sequences

• Multiplicity of highest weight (or singular) vectors associated with character chi_30 of Monster module.at n=40A034418
• a(n+1) is the smallest prime ending with a(n), where a(1)=1.at n=4A053582
• Primes congruent to 3 modulo 4 generated recursively: a(n) = Min_{p, prime; p mod 4 = 3; p|4Q-1}, where Q is the product of all previous terms in the sequence. The initial term is 3.at n=20A057205
• a(1) = 1; thereafter a(n) = the smallest prime of the form d0...0a(n-1), where d is a single digit, or 0 if no such prime exists.at n=4A077714
• Members of A083989 whose 10's complement is also a member of A083989.at n=31A083991
• Primes arising in A089566.at n=3A089567
• Primes from merging of 5 successive digits in decimal expansion of Pi.at n=10A104825
• Smallest of six consecutive primes whose sum of digits is prime.at n=25A106719
• A Moessner triangle using (1, 2, 1, 2, 1, 2, ...).at n=40A125751
• Positive integers of the form (30*m^2+1)/11.at n=20A179339
• Primes p congruent to 11 mod 12 such that (p - 1)/2 does not divide the numerator of the Bernoulli number B(p-1).at n=21A232040
• Hyperartiads.at n=35A270798
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 619", based on the 5-celled von Neumann neighborhood.at n=30A273252
• Primes p such that the sum of the squares of digits of p equals the sum of digits of p^2.at n=15A290972
• Greatest integer N such that the number of base-n-zero containing numbers [<= N] <= the number of base-n-zerofree numbers [<= N].at n=5A306442
• Emirps p such that p == 1 (mod s) and R(p) == 1 (mod s), where R(p) is the digit reversal of p and s the sum of digits of p.at n=24A356947
• Primes p such that the 10's complement A089186(p) and the concatenations of p and A089186(p) and of A089186(p) and p are all prime.at n=28A372082
• a(n) = floor(Sum_{k=n^3..(n+1)^3} k^(1/3)).at n=22A374384
• Prime numbersat n=3654