25001

Appears in sequences

• a(n)-th prime is sum of first k primes for some k.at n=30A020641
• Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=32A023079
• Numbers k such that k^14 == 1 (mod 15^3).at n=29A056087
• Numbers k such that k^4 == 1 (mod 5^5).at n=32A056102
• A089450 indexed by A000040.at n=17A089525
• a(n) = 40*n^2 + 1.at n=25A158602
• Constant term in the reduction of the n-th Fibonacci polynomial by x^3->x^2+2x+1.at n=14A192772
• a(n) = 8*5^n+1.at n=5A199311
• A239461(n) / n^2.at n=24A239464
• Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0.at n=0A263815
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0.at n=10A263816
• Number of (1+1)X(n+1) arrays of permutations of 0..n*2+1 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0.at n=4A263817
• p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = 1 - S - S^2 - S^3.at n=14A292322
• Numbers n such that n^2 = a^2 + b^5 (with integers a, b > 0) and gcd(a, b, n) = 1.at n=21A293284
• Numbers k such that the decimal representation of k ends that of the sum of the first k cubes.at n=15A301912
• a(n) is the number of regions formed by n-secting the angles of an octagon.at n=42A335769
• a(n) = Sum_{k=1..n} k^floor(n/k).at n=25A345100