22369

Properties

Appears in sequences

• Numerator of Sum_{k=1..4} k^(-4).at n=3A007410
• Prime(n)*...*a(n) is the least product of consecutive primes which is non-deficient.at n=33A007686
• Prime(n)*...*a(n) is the least product of consecutive primes which is abundant.at n=33A007708
• Concatenation of prime p and nextprime(p) is prime -> cycles of 2 steps possible.at n=6A036339
• Primes that are each the sum of two, three, and four consecutive composite numbers.at n=27A060339
• Integer part of log(n^n)^(1 + log(1 + log(1 + n))).at n=21A062451
• Numbers which are numerators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n.at n=30A094509
• Where records appear in A109734.at n=37A109740
• (1,2,3) Jasinski-like positive power sequence.at n=12A113914
• Primes which are triangular numbers plus 3.at n=21A159047
• Array T(n,k) read by ascending antidiagonals, where T(n,k) is the numerator of polygamma(n, 1) - polygamma(n, k).at n=32A255008
• Prime numbers p such that p - 2, p^2 - p - 1, p^2 - p + 1 are prime numbers.at n=10A274525
• Numerator of Sum_{k=1..n} 1/k^n.at n=3A276485
• Primes in A301916 but not in A045318.at n=22A320481
• Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = numerator of Sum_{j=1..n} 1/j^k.at n=31A322265
• Prime numbers congruent to 49 or 121 modulo 240 representable by x^2 + 150*y^2.at n=39A325089
• a(1)=1 and a(2)=1; if a(n-1) + a(n-2) == 0 (mod n) then a(n) = (a(n-1) + a(n-2))/n else a(n) = a(n-1) + a(n-2).at n=28A330139
• Value of prime number D for incrementally largest values of minimal x satisfying the equation x^2 - D*y^2 = 3.at n=21A336794
• Value of prime number D for incrementally largest values of minimal y satisfying the equation x^2 - D*y^2 = 3.at n=20A336796
• Triangle read by rows. T(n, k) = A356265(n, k) + A357078(n, k) for 0 <= k <= n.at n=37A357079