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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A373098 Last digit of n*2^n. 2
 0, 2, 8, 4, 4, 0, 4, 6, 8, 8, 0, 8, 2, 6, 6, 0, 6, 4, 2, 2, 0, 2, 8, 4, 4, 0, 4, 6, 8, 8, 0, 8, 2, 6, 6, 0, 6, 4, 2, 2, 0, 2, 8, 4, 4, 0, 4, 6, 8, 8, 0, 8, 2, 6, 6, 0, 6, 4, 2, 2, 0, 2, 8, 4, 4, 0, 4, 6, 8, 8, 0, 8, 2, 6, 6, 0, 6, 4, 2, 2, 0, 2, 8, 4, 4, 0, 4, 6, 8, 8, 0, 8, 2, 6, 6, 0, 6, 4, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Periodic with period 20: [0,2,8,4,4,0,4,6,8,8,0,8,2,6,6,0,6,4,2,2]. LINKS Table of n, a(n) for n=0..99. Index entries for linear recurrences with constant coefficients, signature (0,1,0,-1,1,1,-1,-1,1,0,-1,0,1). FORMULA a(n) = A010879(A036289(n)). a(n) = A373099(n) - 1. a(n) = A373100(n) + 1 (n >= 1). a(n) = 0 if n mod 5 = 0, 2 if n mod 20 = {1, 12, 18, 19}, 8 if n mod 20 = {2, 8, 9, 11}, 4 if n mod 20 = {3, 4, 6, 17}, 6 if n mod 20 = {7, 13, 14, 16}. MAPLE a:= n-> n*2&^n mod 10: seq(a(n), n=0..100); MATHEMATICA a[n_] := Mod[n*2^n, 10] PROG (Python) def a(n): return (n * 2**n) % 10 (PARI) a(n, b=10) = lift(n*Mod(2, b)^n) \\ Hugo Pfoertner, May 24 2024 CROSSREFS Cf. A010879, A036289. Cf. A373099, A373100. Sequence in context: A010595 A109594 A329661 * A254446 A197486 A086311 Adjacent sequences: A373095 A373096 A373097 * A373099 A373100 A373101 KEYWORD nonn,base,easy AUTHOR Javier Rodríguez Ríos, May 23 2024 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.

Last modified August 11 17:54 EDT 2024. Contains 375073 sequences. (Running on oeis4.)