30349

Appears in sequences

• The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r.at n=44A005576
• Numbers k such that k * (1+i)^k + 1 is a Gaussian prime.at n=25A058770
• Numbers n such that n^2*2^n - n*2^((n + 1)/2) + 1 is prime.at n=12A058778
• n * (1+i)^n + i is a Gaussian prime.at n=24A058782
• a(n) = Jacobsthal(n) * Fibonacci(n+1).at n=10A093122
• Upper Beatty array of the golden ratio, (1+sqrt(5))/2.at n=36A181661
• Number of (w,x,y,z) with all terms in {0,...,n} and 2w-x=max{w,x,y,z}-min{w,x,y,z}.at n=39A212756
• a(0)=a(1)=1, a(n) = a(n-1) + a(a(n-2) mod n).at n=42A215525
• Somos's sequence {b(9,n)} defined in comment in A078495: a(0)=a(1)=...=a(20)=1; for n>=21, a(n)=(a(n-1)*a(n-20)+a(n-10)*a(n-11))/a(n-21).at n=49A272038
• Number of n X 4 0..2 arrays with no element equal to any value at offset (-1,-2) (0,-1) or (-1,0) and new values introduced in order 0..2.at n=5A274745
• T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-1,-2) (0,-1) or (-1,0) and new values introduced in order 0..2.at n=41A274749
• Number of 6Xn 0..2 arrays with no element equal to any value at offset (-1,-2) (0,-1) or (-1,0) and new values introduced in order 0..2.at n=3A274753
• a(n) is the least integer k such that k/Fibonacci(n) > 1/4.at n=26A293552
• Numbers b > 1 such that the smallest four primes, i.e., 2, 3, 5 and 7 are base-b Wieferich primes.at n=33A339533