118099

Appears in sequences

• Numbers that are the sum of 7 positive 9th powers.at n=33A003396
• Numbers that are the sum of 3 nonzero 10th powers.at n=7A004803
• Numbers that are the sum of at most 3 nonzero 10th powers.at n=17A004898
• Numbers that are the sum of at most 4 nonzero 10th powers.at n=26A004899
• Numbers that are the sum of at most 5 nonzero 10th powers.at n=37A004900
• Positions where A007600 increases.at n=32A007601
• a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=11A052919
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=21A062547
• Second generation sequence in which each number is skipped that can be written as sum of distinct previous entries. To make the first generation we start with all natural numbers: this gives the powers of 2 (A000079). For the second generation we start with the natural numbers from which are removed the numbers of the first generation.at n=21A072134
• Number of layers of dough separated by butter in successive foldings of croissant dough.at n=11A100702
• a(n) = A137576((3^n-1)/2).at n=9A140320
• a(n) = 1250*n^2 - 700*n + 99.at n=10A154359
• a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3 - 2. It may be considered a Fermat near miss by 2.at n=26A163827
• 2*3^(n-1)-(-1)^n.at n=10A174132
• a(n) = 2*9^n+1.at n=5A199559
• Start with 443; if even, divide by 2; if odd, add next three primes: Orbit of 443 under iterations of A174221, the "PrimeLatz" map.at n=40A293978
• First differences of A302774; Number of terms in A303762 that have prime(n) as their largest prime factor (A006530).at n=21A303749