25607

Appears in sequences

• a(n) = 4^n + 6^n + 7^n.at n=5A074565
• a(n) is the smallest index m such that Sum_{k=2..m} 1/PrimePi(k) >= n, where PrimePi()=A000720().at n=45A074633
• Least k such that the decimal representation of k*n contains only 1's and 0's.at n=42A079339
• Diagonal in array of n-gonal numbers A081422.at n=28A081438
• a(n)=A088599(n)/n.at n=42A088756
• Smallest m such that m * prime(n) consists of decimal digits not greater than 1.at n=13A119483
• Numbers m such that greatest prime divisor of (m-th prime + 1) is 3.at n=29A121820
• Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 10, read by rows.at n=11A153655
• Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 10, read by rows.at n=13A153655
• a(n) = (4*n + 3)*(1 + 2*n^2)/3.at n=21A168574
• Fibonacci sequence beginning 13, 8.at n=17A206610
• Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and first differences in -n..n.at n=41A208995
• Number of tilings of a 15 X n rectangle using 3n pentominoes of shape I.at n=12A247218
• Indices of primes in the 10th-order Fibonacci number sequence, A127194.at n=37A257073
• MM-numbers of crossing, capturing multiset partitions (with empty parts allowed).at n=9A326259
• A triple of positive integers (n,p,k) is admissible if there exist at least two different multisets of k positive integers, {x_1,x_2,...,x_k} and {y_1,y_2,...,y_k}, such that x_1+x_2+...+x_k = y_1+y_2+...+y_k = n and x_1x_2...x_k = y_1y_2...y_k = p. For each n, let A(n) = {(p,k):(n,p,k) is admissible for some k}; then a(n) = |A(n)|.at n=47A334246
• The independence polynomial of the n-folded cube graph evaluated at -1.at n=6A355559