24915

Appears in sequences

• A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).at n=17A001641
• Number of 6-ary rooted trees with n nodes and height exactly 5.at n=16A036643
• Odd numbers with exactly 4 distinct palindromic prime factors.at n=9A046406
• Number of periodic palindromic structures of length n using exactly five different symbols.at n=17A056511
• Expansion of g.f. 1/(1-x-x^2-x^4-x^5).at n=18A079976
• Weight distribution of [151,76,19] binary quadratic-residue (or QR) code.at n=20A080953
• Numbers k such that 2k+1, 4k+1, 6k+1 and 8k+1 are primes.at n=17A124409
• Numbers n for which the alternating sum of the digits of n^n is 0.at n=33A244212
• Beastly reciprocals, or numbers k such that digitsum(1/k) = 666.at n=40A244661
• Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=28A263311
• G.f.: Product_{m>0} (1 + x^m + 2!*x^(2*m) + 3!*x^(3*m) + 4!*x^(4*m)).at n=22A289486
• Number of maximal independent vertex sets (and minimal vertex covers) in the n-wheel graph.at n=33A290612
• Partial sums of A299274.at n=33A299275
• Number of maximal independent vertex sets and minimal vertex covers in the n-trapezohedral graph.at n=17A367644