Let a(1) = 1. Given a(1), ..., a(2^t), find the least k such that a(1) + 2^k, a(2) + 2^k, ..., a(2^t) + 2^k are all composite and a(1) + 2^k > a(2^t). Then a(2^t+i) = a(i) + 2^k for all 1 <= i <= 2^t.
A173281
Let a(1) = 1. Given a(1), ..., a(2^t), find the least k such that a(1) + 2^k, a(2) + 2^k, ..., a(2^t) + 2^k are all composite and a(1) + 2^k > a(2^t). Then a(2^t+i) = a(i) + 2^k for all 1 <= i <= 2^t.
Terms
- a(0) =1a(1) =9a(2) =2049a(3) =2057a(4) =4097a(5) =4105a(6) =6145a(7) =6153a(8) =524289a(9) =524297a(10) =526337a(11) =526345a(12) =528385a(13) =528393a(14) =530433a(15) =530441a(16) =16777217a(17) =16777225a(18) =16779265a(19) =16779273a(20) =16781313a(21) =16781321a(22) =16783361a(23) =16783369a(24) =17301505a(25) =17301513a(26) =17303553a(27) =17303561a(28) =17305601a(29) =17305609
External references
- oeis: A173281