Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Feb 11 2014 02:48:13
%S 2,24,28,311,312,325,337,340,365,398,405,3808,3814,3819,3858,3866,
%T 3906,3959,4039,4122,4203,4246,5065,5103,5161,5547,5610,5700,6339,
%U 6398,6801,6810,6851,7075,7095,7129,7375,7425,7490,8000,8035,8051,8066,8120,8195,8805
%N Starts with 2; has two properties: concatenation of its digits is same string as concatenation of digits of its first differences and sequence and first differences have no term in common. When there is a choice in choosing the next term in the first differences, choose the smallest number not yet present in either the sequence or its first differences.
%D E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.
%H Lars Blomberg, <a href="/A139334/b139334.txt">Table of n, a(n) for n = 1..10000</a>
%e The first differences are 22, 4, 283, 1, 13, 12, 3, 25, 33, 7, 3403, ...
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_ (based on Angelini's article), Jun 08 2008
%E Extended through a(12) by Eric Angelini, Jul 18 2008