354295

Appears in sequences

• Numbers that are the sum of 7 positive 10th powers.at n=33A004807
• Numbers that are the sum of 3 positive 11th powers.at n=7A004814
• Numbers that are the sum of at most 3 positive 11th powers.at n=17A004909
• Numbers that are the sum of at most 4 positive 11th powers.at n=26A004910
• Numbers that are the sum of at most 5 positive 11th powers.at n=37A004911
• Positions where A007600 increases.at n=35A007601
• a(n) = 1 + 2*3^(n-1) with a(0)=2.at n=12A052919
• a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).at n=23A062547
• 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=23A072134
• 2*3^n-(-1)^n.at n=11A081632
• Number of layers of dough separated by butter in successive foldings of croissant dough.at n=12A100702
• Pierpont 3-almost primes. 3-almost primes of form (2^K)*(3^L)+1.at n=20A112797
• a(n) = 6*9^n+1.at n=5A199564
• Number of (n+1)X7 0..3 arrays with no 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=0A203876
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=15A203878
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=20A203878
• First differences of A302774; Number of terms in A303762 that have prime(n) as their largest prime factor (A006530).at n=23A303749
• Number of distinct residues of x^n (mod n^5), x=0..n^5-1.at n=26A365102