25089

Appears in sequences

• Numbers k such that k^2 and k^3 have the same set of digits.at n=32A029797
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 90 ones.at n=25A031858
• Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=16A061364
• Number of unimodal partitions/compositions of n into distinct terms.at n=41A072706
• Numbers n such that mu(n) + mu(n+1) + mu(n+2) + mu(n+3) + mu(n+4) + mu(n+5) + mu(n+6) = 6.at n=18A082967
• Numbers n such that f(n), f(n+1) and f(n+2) are prime, f(m)=72*m^2+7.at n=26A121089
• Partial sums of A032598.at n=16A129330
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1001-1111-0110 pattern in any orientation.at n=12A147416
• a(n) = 32*n^2 + 1.at n=28A158575
• a(n) = (3*7^n-3^n)/2.at n=5A165147
• Expansion of Sum_{k>=0} x^((k+1)^2)/(1-x)^k.at n=58A236310
• If x^2 + 2*y^2 is prime for all positive integers x and y with m = x*y then m is in the sequence.at n=11A287799
• Number of compositions (ordered partitions) of n into heptagonal numbers (A000566).at n=47A322799
• a(n) = Sum_{k=0..n} binomial(4*n,k) * binomial(4*n-k-1,n-k).at n=4A370101
• Number of sets that can be represented as a length-n combination of commas and braces, with elements possibly repeated.at n=37A373516
• Number of multisets summing to n not equal to the first sums of any nonempty multiset.at n=37A390447