|
%I #8 Mar 19 2017 01:09:10
%S 1,2,5,11,12,23,24,25,26,27,50,51,52,53,54,55,56,57,58,108,109,110,
%T 111,112,113,114,115,116,117,118,119,120,121,229,230,231,232,233,234,
%U 235,236,237,238,239,240,241,242,243,244,245,246,247,248,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495
%N Numbers n for which A004001(n) = A283470(n).
%C Equally, numbers n such that A004001(n) = A283469(n).
%H Antti Karttunen, <a href="/A283473/b283473.txt">Table of n, a(n) for n = 1..803</a>
%t a[n_] := a[n] = If[n <= 2, 1, a[a[n - 1]] + a[n - a[n - 1]]]; With[{nn = 500}, Function[s, Select[Range@ nn, a@ # == s[[#]] &]]@ Table[BitXor[a[#], a[n - #]] &@ a[n - 1] + Boole[n <= 2], {n, nn}]] (* _Michael De Vlieger_, Mar 18 2017, after _Robert G. Wilson v_ at A004001 *)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A283473 (ZERO-POS 1 1 A283472))
%o (define A283473 (MATCHING-POS 1 1 (lambda (n) (= (A004001 n) (A283470 n)))))
%Y Positions of zeros in A283472.
%Y Cf. A004001, A283469, A283470, A283471.
%K nonn
%O 1,2
%A _Antti Karttunen_, Mar 18 2017
|
