

A210025


a(0)=1. Let S = string of digits of a(0),a(1),a(2),... To get a(n+1) (n>=0), subtract next element of S from a(n) if that would give a positive number, otherwise add it to a(n).


5



1, 2, 4, 8, 16, 15, 9, 8, 3, 12, 4, 1, 2, 4, 8, 7, 5, 1, 9, 2, 7, 6, 15, 13, 6, 12, 11, 6, 5, 2, 8, 7, 5, 4, 3, 9, 4, 2, 10, 3, 8, 4, 1, 10, 6, 4, 3, 3, 6, 14, 10, 9, 8, 8, 2, 6, 3, 6, 12, 11, 7, 6, 6, 15, 7, 15, 13, 7, 4, 10, 9, 7, 6, 5, 12, 6, 12, 11, 6, 13
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


REFERENCES

Eric Angelini, Posting to Sequence Fans Mailing List, Mar 06 2012


LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Index entries for sequences related to Recamán's sequence


EXAMPLE

1.2.4.8.16.15.9.8.3.12.4.1.2.4.8.7.5.1.9.2.7.6.15.13.6.12.11.6.5.2.8.7.5.... < a(0), a(1), ...
.1.2.4.8..1..6.1.5.9..8.3.1.2.4.1.2.4.8.7.5.1.9..2..7.6..1..5.1.3.6.1.2.... < S


CROSSREFS

Cf. A005132, A210026 (for S), A210022, A210023.
Sequence in context: A108565 A066005 A066600 * A309571 A210023 A301807
Adjacent sequences: A210022 A210023 A210024 * A210026 A210027 A210028


KEYWORD

nonn,base,easy


AUTHOR

N. J. A. Sloane, Mar 16 2012


EXTENSIONS

More terms from Alois P. Heinz, Aug 17 2012


STATUS

approved



