21355
domain: N
Appears in sequences
- a(1) = 1; a(n+1) = floor((sum{k=1 to n} a(k)^3)^(1/3)).at n=51A016085
- Prefix primes in base 8 (written in base 8).at n=47A024768
- Least n such that n consecutive values in A080378 equal 0; i.e., exactly n differences between consecutive primes are divisible by 4.at n=11A080380
- First i such that gcd(prime(i)+1, prime(i+1)+1, ..., prime(i+n)+1) > 2.at n=9A111038
- First i such that gcd(prime(i)+1, prime(i+1)+1, ..., prime(i+n)+1) > 2.at n=10A111038
- First i such that gcd(prime(i)+1, prime(i+1)+1, ..., prime(i+n)+1) > 2.at n=11A111038
- Number of length 3 1..(n+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=43A254220