26068

Appears in sequences

• Numbers k such that k^4 == 1 (mod 5^5).at n=33A056102
• Numbers k such that sopf(k) = d(k) where d(k) = A001223(k) and sopf(k) = A008472(k).at n=35A064010
• Numbers k such that phi(k)*sigma(k) is a cube.at n=15A114077
• Third accumulation array, T, of the natural number array A000027, by antidiagonals.at n=60A185508
• Numbers n such that n^2 + 1 is divisible by a 5th power.at n=16A218564
• Number of contractible "tight" meanders of width n.at n=14A230439
• Numbers for which the number of prime divisors counted with multiplicity and the sum of the distinct prime divisors are both perfect.at n=17A233563
• E.g.f.: exp(4)*P(x) - Q(x), where P(x) = 1/Product_{n>=1} (1 - x^n/n) and Q(x) = Sum_{n>=1} 4^n/Product_{k=1..n} (k - x^k).at n=6A249477
• Number of nX3 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=8A280156
• T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=57A280161
• Column 4 of A060244.at n=27A291589
• Number of separable partitions of n in which the number of distinct (repeatable) parts <= 6.at n=39A325715
• a(n) = (n^3+5*n+3)/3 + 2*floor(n/2) + a(n-2), with a(0)=1 and a(1)=3.at n=27A336529
• Number of rooted graceful labelings with n edges.at n=8A338987
• Number of integer partitions of n having a unique mode.at n=39A362608
• a(n) = Sum_{k=0..n} (-1)^k * binomial(n+2*k+1,n-k) * Fibonacci(k+1).at n=12A390856