A353717 a(n) = index of n in A353709, or -1 if n does not appear there.
0, 1, 2, 5, 3, 13, 10, 53, 4, 22, 14, 56, 7, 34, 17, 76, 6, 9, 20, 69, 24, 38, 42, 86, 28, 31, 49, 90, 46, 185, 73, 245, 8, 19, 23, 26, 30, 50, 94, 322, 11, 102, 39, 105, 70, 109, 252, 549, 15, 65, 98, 117, 80, 83, 124, 1047, 113, 225, 242, 692, 249, 1209, 553, 1647, 12, 16, 29, 114, 21, 137, 63, 329, 25, 99, 133, 312, 60, 140, 339, 1007, 54, 175, 148, 189, 57, 238
Offset: 0
Keywords
Links
- Rémy Sigrist, Table of n, a(n) for n = 0..16383
- Rémy Sigrist, C++ program
Crossrefs
Cf. A353709.
Programs
-
Maple
b:= proc() false end: t:= 2: g:= proc(n) option remember; global t; local k; if n<2 then n else for k from t while b(k) or Bits[And](k, g(n-2))>0 or Bits[And](k, g(n-1))>0 do od; b(k):=true; while b(t) do t:=t+1 od; k fi end: a:= proc() local t, a; t, a:= -1, proc() -1 end; proc(n) local h; while a(n) = -1 do t:= t+1; h:= g(t); if a(h) = -1 then a(h):= t fi od; a(n) end end(): seq(a(n), n=0..85); # Alois P. Heinz, May 09 2022
Comments