64577
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Primes p = prime(k) such that the decimal representation of p contains k as a substring.at n=3A075902
- Numbers k such that the value pi(k), the number of primes <= k, can be obtained deleting some of the repeating adjacent digits of k.at n=14A113898
- Primes p such that pi(p) is obtained by dropping one of the digits of p in decimal expansion.at n=11A114924
- Primes that are congruent to 7 mod n, where n is the index of the prime.at n=9A171434
- Number of flat special rim-hook tableaux.at n=23A178940
- Hilltop maps: number of n X n binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 n X n array.at n=3A219057
- Hilltop maps: number of nX4 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nX4 array.at n=3A219059
- T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nXk array.at n=24A219063
- Hilltop maps: number of 4Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 4Xn array.at n=3A219065
- Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.at n=22A224533
- Primes p such that pi(p) = floor(p/10), where pi is the prime counting function.at n=2A236469
- Primes p such that p+2 is prime with prime(p+2)-prime(p)=6.at n=28A261533
- Number of partitions of n with even minimal part and odd maximal part.at n=47A325344
- A sequence of integers from an additive problem with prime numbers.at n=42A348472
- a(n) = Sum_{k=1..n} k * floor(n/k)^3.at n=34A350108
- Primes associated with the indices in A362060.at n=11A362066
- Triangle read by rows: T(n,k) = number of collections of up to k subsets of [n] covering [n], with [0]={}; n>=0, k=0..2^n.at n=33A381683
- Prime numbersat n=6457