38303

Properties

Appears in sequences

• INVERT transform of A000081 = [1, 1, 1, 2, 4, 9, 20, 48, 115, 286,...].at n=12A051529
• Numbers k such that k!! + 2^8 is prime.at n=19A076195
• Same triangle as A106243, but with rows read in boustrophedon manner, i.e., in the order in which they were created.at n=42A106242
• Triangle read by rows from left to right. However, triangle is constructed in the boustrophedon way, reading alternately right to left and left to right. Top entry is 1. In all later rows, initial entry is 0, other entries are sum of previous entry in that row plus sum of two entries above it in previous row.at n=38A106243
• Consider the array T(n, m) = m-th prime of the form n*i(i+1)/2 +/- 1. This sequence is the main diagonal.at n=18A125765
• a(1)=1; for n>=2, a(n) = the largest prime dividing n*a(n-1) + 1.at n=21A134487
• List of different primes in Pascal-like triangles with index of asymmetry y = 2 and index of obliquity z = 0 or z = 1.at n=10A141067
• Primes p such that (p-7)/8 and 8p + 7 are both prime.at n=33A158238
• Collatz (or 3x+1) trajectory starting at 10087.at n=11A161022
• Primes of the form 3*m^2 - 4.at n=25A201716
• Primes having only {0, 3, 8} as digits.at n=11A261434
• Number of aperiodic necklaces (Lyndon words) with k<=8 black beads and n-k white beads.at n=23A277633
• Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median.at n=43A363740
• Number of compositions of 5*n-2 into parts 4 and 5.at n=15A369850
• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) + a(n-5) with a(1) = a(2) = a(3) = 0, a(4) = 1, and a(5) = 3.at n=20A385142
• Primes having only {0, 3, 4, 8} as digits.at n=28A386059
• Primes having only {0, 3, 5, 8} as digits.at n=37A386063
• Primes having only {0, 3, 6, 8} as digits.at n=26A386066
• Primes having only {0, 3, 8, 9} as digits.at n=43A386069
• a(n) = Sum_{k=0..floor(n/2)} binomial(k,2*(n-2*k)).at n=39A392250