A169931 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A169931

a(n) = 2*n in the arithmetic defined in A169918.

2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 32, 33, 34, 35, 36, 37, 38, 39, 30, 31, 42, 43, 44, 45, 46, 47, 48, 49, 40, 41, 52, 53, 54, 55, 56, 57, 58, 59, 50, 51, 62, 63, 64, 65, 66, 67, 68, 69, 60, 61, 72, 73, 74, 75, 76, 77, 78, 79, 70, 71, 82, 83, 84, 85, 86, 87, 88, 89, 80, 81, 92, 93, 94, 95, 96

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

Equivalently, increase each (decimal) digit by 2 and take each result modulo 10. I.e., apply d -> (d+2 mod 10) to each digit of n. - M. F. Hasler, Mar 25 2015

LINKS

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

FORMULA

A169931 = A048379 o A048379 (function A048379 applied twice). - M. F. Hasler, Mar 25 2015

MATHEMATICA

Table[FromDigits[Mod[IntegerDigits[n]+2, 10]], {n, 0, 100}] (* Harvey P. Dale, Aug 17 2021 *)

PROG

(PARI) A169931(n)=2*!n+apply(d->(d+2)%10, n=digits(n))*vector(#n, i, 10^(#n-i)) \\ M. F. Hasler, Mar 25 2015

CROSSREFS

Cf. A048379, A169918.

Sequence in context: A218978 A309589 A309590 * A141022 A004720 A088118

Adjacent sequences: A169928 A169929 A169930 * A169932 A169933 A169934

KEYWORD

nonn,base

AUTHOR

David Applegate, Marc LeBrun and N. J. A. Sloane, Jul 20 2010

STATUS

approved