195313

Appears in sequences

• Strong pseudoprimes to base 5.at n=24A020231
• a(n) = (5^n + 1)/2.at n=8A034478
• Zsigmondy numbers for a = 5, b = 1: Zs(n, 5, 1) is the greatest divisor of 5^n - 1^n (A024049) that is relatively prime to 5^m - 1^m for all positive integers m < n.at n=15A064081
• (5^n+(-1)^n)/2.at n=8A081340
• Table T(m,n) = (3^m + 5^n)/2, for m, n = 0, 2, 4, 6, ... read by antidiagonals downwards.at n=10A081458
• Square array read by antidiagonals: T(n,k) = (k*(2*k+3)^n + 1)/(k+1).at n=53A083075
• Overpseudoprimes to base 5.at n=13A141390
• a(n) = ceiling((n+1)^4/2).at n=24A171714
• a(n) = ((2*n+1)^4+1)/2.at n=12A175110
• Number of compositions of even natural numbers into 8 parts <= n.at n=4A191495
• Dispersion of A016873, (5k+3), by antidiagonals.at n=36A191705
• Table T(m,n) = (5^m + 3^n)/2, m,n = 0,1,2,..., read by antidiagonals.at n=44A193770
• Permutation of natural numbers, the even bisection of A241909 incremented by one and halved; equally, a composition of A241909 and A048673: a(n) = A048673(A241909(n)).at n=37A243066
• Square array read by descending antidiagonals: T(n,k) = ((2^(n+1) + 1)^(k-1) + 1)/2.at n=36A266577
• Number of partitions of n^4 into at most two parts.at n=25A274323
• Number of maximal irredundant sets in the n-Andrásfai graph.at n=22A291053
• Numbers z such that x^2 + y^8 = z^2 (with positive integers x and y) and gcd(x, y, z) = 1.at n=5A293695
• a(n) is the smallest positive integer of length (distance from origin) n in the Cayley graph of the integers generated by all powers of 5.at n=16A294566
• a(n) = ((2*n+1)^8 + 1)/2.at n=2A359844
• Composite numbers k == 3, 7 (mod 10) such that 5^((k-1)/2) == -1 (mod k).at n=2A375916