The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169931 a(n) = 2*n in the arithmetic defined in A169918. 3
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
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
Sequence in context: A218978 A309589 A309590 * A141022 A004720 A088118
KEYWORD
nonn,base
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 20:41 EDT 2024. Contains 372494 sequences. (Running on oeis4.)