a(n) are values of k that yield "record-breaking" integer sequence lengths for the recursion: b(i) = 3*(b(i-1) + b(i-2))/2, with b(0) = 1 and b(1) = k.
A249861
a(n) are values of k that yield "record-breaking" integer sequence lengths for the recursion: b(i) = 3*(b(i-1) + b(i-2))/2, with b(0) = 1 and b(1) = k.
Terms
- a(0) =1a(1) =5a(2) =37a(3) =101a(4) =229a(5) =485a(6) =2533a(7) =6629a(8) =23013a(9) =88549a(10) =219621a(11) =481765a(12) =1006053a(13) =3103205a(14) =7297509a(15) =24074725a(16) =158292453a(17) =1232034277a(18) =3379517925a(19) =7674485221a(20) =282552392165
External references
- oeis: A249861