The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A029742

Nonpalindromic numbers.
(history; published version)

#37 by Alois P. Heinz at Wed Jul 24 15:34:00 EDT 2024

STATUS

proposed

approved

#36 by Chai Wah Wu at Wed Jul 24 11:12:55 EDT 2024

STATUS

editing

proposed

#35 by Chai Wah Wu at Wed Jul 24 11:12:29 EDT 2024

PROG

def f(x): return n+intx//10**((l:=len(s:=str(x))[:)-(bk:=(l:=len(s))+1>>1)])-(int(s[bk-1::-1])>int(s[l>>1:])x%10**k)+10**(bk-1+(l&1^1))-1

STATUS

proposed

editing

#34 by Chai Wah Wu at Wed Jul 24 10:31:27 EDT 2024

STATUS

editing

proposed

#33 by Chai Wah Wu at Wed Jul 24 10:31:14 EDT 2024

PROG

def f(x): return n+int((s:=str(x))[:(kb:=(l:=len(s))+1>>1)])-(int(s[kb-1::-1])>int(s[l>>1:]))+10**(kb-1+(l&1^1))-1

return m # Chai Wah Wu, Jul 24 2024

#32 by Chai Wah Wu at Wed Jul 24 10:29:55 EDT 2024

PROG

(Python)

def A029742(n):

def f(x): return n+int((s:=str(x))[:(k:=(l:=len(s))+1>>1)])-(int(s[k-1::-1])>int(s[l>>1:]))+10**(k-1+(l&1^1))-1

m, k = n, f(n)

while m != k:

m, k = k, f(k)

return m # Chai Wah Wu, Jul 24 2024

STATUS

approved

editing

#31 by Jon E. Schoenfield at Sat Jun 18 13:45:46 EDT 2022

STATUS

editing

approved

#30 by Jon E. Schoenfield at Sat Jun 18 13:45:38 EDT 2022

PROG

(MAGMAMagma) [n: n in [0..150] | Intseq(n) ne Reverse(Intseq(n))]; // Bruno Berselli, Apr 01 2015

STATUS

approved

editing

#29 by Amiram Eldar at Tue Oct 12 15:27:39 EDT 2021

STATUS

reviewed

approved

#28 by Michael De Vlieger at Tue Oct 12 15:21:42 EDT 2021

STATUS

proposed

reviewed