|
|
|
|
|
|
|
|
|
#15 by Michel Marcus at Sat Oct 29 12:00:59 EDT 2022
|
|
|
|
|
|
|
|
#14 by Joerg Arndt at Sat Oct 29 11:50:45 EDT 2022
|
|
|
|
|
|
|
|
#13 by Chai Wah Wu at Sat Oct 29 11:12:04 EDT 2022
|
|
|
|
|
|
|
|
#12 by Chai Wah Wu at Sat Oct 29 11:12:00 EDT 2022
|
|
| PROG
|
(Python)
from itertools import count
def A357195(n): return next(filter(lambda n:(s := str(n))[:(t:=len(s)+1>>1)]==s[:-t-1:-1], (k*((n<<1)+k-1)>>1 for k in count(1)))) # Chai Wah Wu, Oct 29 2022
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#11 by N. J. A. Sloane at Sat Oct 29 08:25:44 EDT 2022
|
|
|
|
|
|
|
|
#10 by N. J. A. Sloane at Sat Oct 29 08:25:41 EDT 2022
|
|
| NAME
|
a(n) is the smallest palindrome of the form k*(2*n+k-1)/2, where k is a positive integer.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#9 by Michel Marcus at Sat Sep 17 13:00:24 EDT 2022
|
|
|
|
|
|
|
|
#8 by Michel Marcus at Sat Sep 17 13:00:18 EDT 2022
|
|
| PROG
|
(PARI) ispal(p) = my(d=digits(p)); d==Vecrev(d);
a(n) = my(k=1); while(!ispal(x=k*(2*n+k-1)/2), k++); x; \\ Michel Marcus, Sep 17 2022
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#7 by Gleb Ivanov at Sat Sep 17 07:56:58 EDT 2022
|
|
|
|
|
|
|
|
#6 by Gleb Ivanov at Sat Sep 17 07:56:56 EDT 2022
|
|
|
|
|
|
|
