35401

Properties

Appears in sequences

• Quintan primes: p = (x^5 + y^5)/(x + y).at n=21A002650
• A convolution triangle of numbers, generalizing Pascal's triangle A007318.at n=38A035324
• 3-fold convolution of A001700(n), n >= 0.at n=6A045720
• Primes that are a concatenation of 3, 5 and a prime.at n=18A101219
• a(n) = 16 + floor(Sum_{j=1..n-1} a(j)/2).at n=19A120142
• a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4) with n>3, a(0)=1, a(1)=2, a(2)=3, a(3)=6.at n=20A131269
• Infinite square array read by antidiagonals: a(q,n) is the coefficient of z^n in the series expansion of C(z)^q/(1-4z)^(3/2), where C(z) = (1-sqrt(1-4z))/(2z) is the Catalan function (q,n = 0,1,2,...).at n=51A143019
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=11A148257
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (-1, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=11A148258
• Number of sets (in the Hausdorff metric geometry) at each location between two sets defining a polygonal configuration consisting of two 4-gonal polygonal components chained with string components of length l as l varies.at n=12A152929
• Primes p such that all the digits needed to write the consecutive Primes from 2 to p fill exactly a square (no holes, no overlaps).at n=38A158024
• Number of 6 X n binary arrays without the pattern 0 1 diagonally, vertically, antidiagonally or horizontally.at n=17A188557
• Number of UUU's in all the dispersed Dyck paths of semilength n (i.e., in all Motzkin paths of length n; U=(1,1)).at n=18A191520
• Primes of the form 2*n^2 + 46*n + 21.at n=12A217495
• Primes p with P(p+1) also prime, where P(.) is the partition function (A000041).at n=17A234900
• a(n) = prime(k) with k = n^2 + prime(n)^2.at n=16A243892
• Centered 20-gonal (or icosagonal) primes.at n=14A264845
• Numbers k such that 4*10^k - 63 is prime.at n=23A279793
• a(n) is the smallest prime p such that p + 6*t is also prime for every triangular number t up to, but not including, the n-th triangular number (or 0 if no such prime exists).at n=12A323740
• Emirps p such that if q is the next emirp after p, 2*q-p is also an emirp.at n=36A350852