39953

Properties

Appears in sequences

• Number of triples {i,j,k}, i>1, j>1, k>1, such that i*j*k < n^3.at n=19A037092
• Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 2.at n=10A050664
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=floor(n/2)).at n=43A114486
• Primes having only {3, 5, 9} as digits.at n=34A260227
• a(n) is the number of equivalence classes of simple, open polygonal chains consisting of two segments and with all three vertices on the lattice points of an n X n grid.at n=16A272053
• Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives p values.at n=29A359742
• Least prime pn such that there is a set p1 < p2 < ... < pn of primes such that, for any distinct p and q in the set, p + q + 1 is prime.at n=13A362629
• Expansion of 1/(1 - x/(1 - 4*x)^(1/2))^2.at n=8A382539
• Prime numbersat n=4199