%I #15 May 28 2014 23:01:09
%S 1,1,1,4,1,7,11,5,32,17,47,115,13,256,217,295,1024,139,1909,2465,1631,
%T 8192,3299,13085,26281,6487,65536,46075,84997,262144,7153,517135,
%U 545747,502829,2097152,588665,3605639,5960299,2428309,16777216,9492289
%N First differences of A006899.
%C In the 14th century Levi Ben Gerson proved that this sequence contains only four 1s; see A235365, A235366, A236210. - _Jonathan Sondow_, Jan 20 2014
%H Reinhard Zumkeller, <a href="/A108906/b108906.txt">Table of n, a(n) for n = 1..1000</a>
%p A:={seq(2^n,n=0..63)}: B:={seq(3^n,n=0..40)}: C:=sort(convert(A union B,list)): seq(C[j]-C[j-1],j=2..44); # _Emeric Deutsch_, Aug 03 2005
%t nn = 10^20; t = Union[ 2^Range[0, Floor[Log[2, nn]]], 3^Range[0, Floor[Log[3, nn]]]]; Differences@ t (* _Robert G. Wilson v_, May 26 2014 *)
%o (Haskell)
%o a108906 n = a108906_list !! (n-1)
%o a108906_list = zipWith (-) (tail a006899_list) a006899_list
%o -- _Reinhard Zumkeller_, Oct 09 2013
%Y Cf. A006899.
%Y Cf. also A235365, A235366, A236210.
%K easy,nonn
%O 1,4
%A Ali A. Tanara (tanara(AT)khayam.ut.ac.ir), Jul 17 2005
%E More terms from _Emeric Deutsch_, Aug 03 2005
|