35317
domain: N
Properties
Primality
- Prime
- yes
Appears in sequences
- Cuban primes: primes which are the difference of two consecutive cubes.at n=43A002407
- Conjecturally, number of infinitely recurring prime patterns of width 2n-1.at n=29A023189
- Gaps of 2 in sequence A038593 (upper terms).at n=22A038644
- Numbers p such that p = (prime(n)+ prime(n+2))/2 is prime for prime indices n=2, 3, 5...at n=30A098038
- Numbers n such that the numbers of divisors of n,n+1,n+2 and n+3 are k,2k,4k,8k respectively for some k.at n=17A100364
- Primes that are a concatenation of 3, 5 and a prime.at n=16A101219
- Number of partitions of 3-smooth numbers into parts not greater than 3.at n=35A117220
- Number of unlabeled digraphs on n vertices such that every vertex has outdegree 2.at n=6A129524
- Primes of form 3*p*(p-1)+1 with p also a prime.at n=12A165683
- Number of unlabeled digraphs on n vertices such that every vertex has outdegree 4.at n=6A185194
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 809", based on the 5-celled von Neumann neighborhood.at n=32A273612
- Primes of the form (1 + x)^y + (-x)^y where y is a divisor of x.at n=41A285887
- Compound filter: a(n) = P(A046523(n), A161942(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=71A286034
- Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled vertices such that every vertex has outdegree k, n >= 1, 0 <= k < n.at n=23A329228
- Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled vertices such that every vertex has outdegree k, n >= 1, 0 <= k < n.at n=25A329228
- Numbers that are the sum of four third powers in seven or more ways.at n=30A345150
- Numbers that are the sum of four third powers in exactly seven ways.at n=22A345151
- a(n) = Sum_{d|n} (n-d) * d!.at n=13A348145
- Numbers in a hexagonal tiling (seen as concentric rings) which have exactly three neighbors whose difference from it is prime.at n=33A372223
- a(n) is the least number k such that A380802(k) = n, or -1 if no such number exists.at n=20A380803