41941

Properties

Appears in sequences

• Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d = 2, 4 or 6) and forming d-pattern = [6, 6, 4]; short d-string notation of pattern = [664].at n=26A078858
• Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,4,2).at n=4A078966
• Home primes whose homeliness is greater than 5.at n=22A133965
• Home primes whose homeliness is 6.at n=12A133966
• Binomial transform of [1, 2, 3, 4, 0, 0, 0, ...].at n=40A139488
• Expansion of (2/(3*sqrt(1-4*z)-1+4*z))*((1-sqrt(1-4*z))/(2*z))^k with k=9.at n=6A172066
• Primes p such that each of the numbers p^k for k=1..5 has exactly two 1s in its decimal representation.at n=4A175964
• Honaker primes of the form p = 2*k-1 with sum-of-digits(p) = sum-of-digits(k).at n=24A176111
• Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).at n=33A210465
• Number of unimodal maps [1..n]->[0..3].at n=15A223659
• Greatest prime factor of n^6+1.at n=39A240549
• Triangle read by rows in which each new term is the sum of its two largest neighbors in the structure.at n=41A278645
• Expansion of g.f.: 1/Sum_{p odd prime} x^p (odd powers only).at n=37A352479
• a(n) = Sum_{k=0..n} (-1)^k * binomial(3*n-k+3,n-k).at n=6A390588
• Prime numbersat n=4384