The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A358647 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A358647

Final digit reached by traveling right (with wraparound) through the digits of n. Each move steps right k places, where k is the digit at the beginning of the move. Moves begin at the most significant digit and d moves are made, where d is the number of digits in n.
(history; published version)

#24 by Michael De Vlieger at Wed Nov 30 12:39:40 EST 2022

STATUS

reviewed

approved

#23 by Michel Marcus at Wed Nov 30 12:21:28 EST 2022

STATUS

proposed

reviewed

#22 by Chai Wah Wu at Wed Nov 30 12:07:14 EST 2022

STATUS

editing

proposed

#21 by Chai Wah Wu at Wed Nov 30 12:07:03 EST 2022

PROG

return s[i] # Chai Wah Wu, Nov 30 2022

#20 by Chai Wah Wu at Wed Nov 30 12:06:51 EST 2022

PROG

(Python)

def A358647(n):

s = list(map(int, str(n)))

l, i = len(s), 0

for _ in range(l):

i = (i+s[i])%l

return s[i] # Chai Wah Wu, Nov 30 2022

STATUS

approved

editing

#19 by Peter Luschny at Wed Nov 30 08:26:49 EST 2022

STATUS

reviewed

approved

#18 by Kevin Ryde at Tue Nov 29 20:32:24 EST 2022

STATUS

proposed

reviewed

#17 by Moosa Nasir at Mon Nov 28 07:52:56 EST 2022

STATUS

editing

proposed

Discussion

Mon Nov 28

08:29

Michel Marcus: ah yes offset 0

#16 by Moosa Nasir at Mon Nov 28 07:52:36 EST 2022

OFFSET

1,0,3

STATUS

proposed

editing

#15 by Kevin Ryde at Fri Nov 25 02:36:16 EST 2022

STATUS

editing

proposed

Discussion

Fri Nov 25

02:44

Moosa Nasir: I think it won't hurt to add it

Sat Nov 26

03:12

Michel Marcus: I don not understand why when n<10, you get a(n) = n-1 ?

11:15

Moosa Nasir: Isn't it when n < 10, a(n) = n. The sequence starts at n = 0. Did I make a mistake in the offset section?

Mon Nov 28

07:01

Kevin Ryde: Ah yes set offset 0 if you start at n=0.