25205
domain: N
Appears in sequences
- Numbers k that divide s(k), where s(1)=1, s(j)=5*s(j-1)+j.at n=7A014852
- Composite numbers k such that sigma(k) / d(k) is prime.at n=24A048969
- Starting positions of strings of 3 1's in the decimal expansion of Pi.at n=25A050209
- Largest number whose factorial is less than 10^(10^n).at n=5A119906
- Values of c such that (c+9*b)*Prime(n)#-1 is the least prime such that (c+k*b)*Prime(n)#-1 is prime for k=0 to 9 with c+9*b < Prime(n)# , or 0 if no solution. Prime(n)#=n-th primorial.at n=15A188366
- Number of ways prime(n) can be expressed as the sum of distinct smaller noncomposites.at n=51A215966
- Triangle T(n,k) giving the smallest term in "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k.at n=25A230428
- Number of Motzkin meanders of length n with an even number of peaks.at n=11A307575
- A digitized pure tuning tone, sampled at standard settings for consumer audio: a(n) = floor(sin(2*Pi*(440/44100)*n)*32767).at n=14A320277
- Numbers of the form p^2*q, with odd primes p > q, such that q divides p-1.at n=17A350638
- Numbers k such that sigma(k) = psi(k) + tau(k).at n=35A387953