536870913

Appears in sequences

• a(n) = 2^n + 1.at n=29A000051
• Pisot sequence L(5,9).at n=27A020737
• Pisot sequence L(3,5).at n=28A048578
• Expansion of (2-3*x-x^2+x^3)/((1-x)*(1+x)*(1-2*x)).at n=30A052950
• a(n) = 2^n + (-1)^(n+1).at n=29A062510
• a(n) = 2^n - mu(n).at n=28A062777
• a(n) = gcd(2^((n*(n+1)/2)) + 1, 2^n + 1).at n=28A066827
• Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=29A069111
• Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.at n=28A081547
• a(0) = 1; for n>0, a(n) = 2^n + 1.at n=29A083318
• Partial sums of A084509. Positions of ones in the first differences of A084506.at n=16A084508
• a(n) = 2^(2*n+1) + 1.at n=14A087289
• Smallest k such that k^3 == 1 (mod some n-th power), k > 1.at n=28A088039
• Expansion of (1-x-x^2)/((1-x)*(1-2*x)).at n=30A094373
• a(n) = 2^p + 1 where p is the n-th prime.at n=9A098640
• a(n) = 2^n + sin(n*Pi/2).at n=29A100455
• a(n) is the starting position of the first run of n ones in A014963.at n=9A110968
• Rows of A114000 expressed as decimals (a sequence related to the number of divisors of 2n-1).at n=29A114001
• Smallest m such that A008687(m) = n.at n=30A127904
• Binomial transform of A010882.at n=28A130750