A210023 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 different from a(0),...,a(n), otherwise add it to a(n).

1, 2, 4, 8, 16, 15, 9, 10, 5, 14, 13, 13, 18, 17, 21, 20, 23, 22, 19, 20, 12, 11, 18, 20, 21, 23, 23, 25, 28, 26, 24, 25, 34, 32, 32, 31, 29, 30, 31, 32, 40, 38, 38, 36, 35, 33, 36, 38, 41, 39, 44, 42, 50, 48, 54, 52, 56, 58, 53, 56, 60, 57, 55, 58, 60, 63, 62, 64, 73, 70, 70, 67, 66, 69, 71, 75, 75, 72, 80, 77, 85, 82, 76, 79, 74, 77, 80, 83, 89, 86, 78, 82, 81, 84, 93, 97, 101, 105, 103, 98, 98

Offset

0,2

Comments

A base-dependent variant of Recamán's sequence A005132.

References

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

Links

Table of n, a(n) for n=0..100.

Index entries for sequences related to Recamán's sequence

Crossrefs

Cf. A005132, A210022 (for S), A210025, A210026.

Sequence in context: A066600 A210025 A309571 * A301807 A062116 A362896

Adjacent sequences: A210020 A210021 A210022 * A210024 A210025 A210026

Keyword

nonn,base

Author

N. J. A. Sloane, Mar 16 2012

Extensions

Corrected and extended by Max Alekseyev, Nov 11 2012

Offset corrected by N. J. A. Sloane, Jun 16 2021

Status

approved