18829

Appears in sequences

• Numbers that are the sum of 6 positive 7th powers.at n=36A003373
• Strong pseudoprimes to base 70.at n=16A020296
• Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 9 (most significant digit on right and removing all least significant zeros before concatenation).at n=10A029526
• a(n) = 5^n mod 2^n.at n=15A029757
• Composite numbers whose prime factors contain no digits other than 1 and 9.at n=17A036309
• Composite numbers whose divisors (except 1) all contain the digit 9.at n=35A062680
• 100000n+1, 100000n+3, 100000n+7, 100000n+9 are all primes.at n=6A064964
• Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.at n=16A082967
• Numbers appearing in the cycles of the "Recurring Digital Invariant Variant" problem described in A151543.at n=40A151544
• Base-10 pseudo-altruistic numbers.at n=24A157714
• Number of 0..n arrays x(0..3) of 4 elements without any interior element greater than both neighbors or less than both neighbors.at n=17A200872
• a(n) = n*(3*n^2 - 5*n + 3).at n=19A226450
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) - b(n-2) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=17A294423
• Starting at n, a(n) is the number of times we move from a negative position to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=32A324683
• Starting at n, a(n) is the number of times we move from a negative position to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=33A324683
• Starting at n, a(n) is the number of times we move from a negative position to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=34A324683
• One of the two successive approximations up to 5^n for the 5-adic integer sqrt(-9). This is the 4 (mod 5) case (except for n = 0).at n=7A327303
• Recurrence a(1) = 1, a(2) = 5; a(n) = (a(n-1) + a(n-2))/GCD(a(n-1),a(n-2)) + 1.at n=36A349576
• Numbers k such that A073734(k) is neither squarefree nor a prime power.at n=7A365899
• Smallest k such that A073734(k) is in A055932, where A073734 is the GCD of consecutive terms of the EKG sequence A064413.at n=11A380506