4294967297

Appears in sequences

• a(n) = 2^n + 1.at n=32A000051
• Fermat numbers: a(n) = 2^(2^n) + 1.at n=5A000215
• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=32A001317
• An infinite coprime sequence defined by recursion.at n=9A002716
• Jacobsthal-Lucas numbers.at n=32A014551
• 2^(2^n) +- 1 without repeats.at n=10A016043
• Pisot sequence L(5,9).at n=30A020737
• Numbers k such that k^3 is palindromic in base 16.at n=24A029735
• Sum of eighth powers of unitary divisors.at n=15A034682
• One-dimensional cellular automaton 'sigma-minus' (Rule 90): 000,001,010,011,100,101,110,111 -> 0,1,0,1,1,0,1,0.at n=16A038183
• Numbers whose cube is palindromic in base 4.at n=17A046231
• Pisot sequence L(3,5).at n=31A048578
• a(n) = 4^n + 1.at n=16A052539
• a(n) = n^8 + 1.at n=16A060890
• a(n) = n^16 + 1.at n=4A060895
• a(n) = (lcm_{k=0..n} (2^k + 1))/(lcm_{k=0..n-1} (2^k + 1)).at n=31A066845
• a(n) = n^phi(n) + 1.at n=15A066915
• Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=32A069111
• Value of n-th cyclotomic polynomial at n.at n=15A070518
• Value of n-th cyclotomic polynomial at 2^n.at n=7A070526