|
|
|
|
#22 by OEIS Server at Wed Mar 20 11:48:51 EDT 2024
|
| LINKS
|
Michael S. Branicky, <a href="/A068855/b068855_2.txt">Table of n, a(n) for n = 1..2500</a>
|
|
|
|
#21 by Alois P. Heinz at Wed Mar 20 11:48:51 EDT 2024
|
|
|
Discussion
|
Wed Mar 20
| 11:48
| OEIS Server: Installed first b-file as b068855.txt.
|
|
|
|
#20 by Michael S. Branicky at Wed Mar 20 11:43:37 EDT 2024
|
|
|
|
#19 by Michael S. Branicky at Wed Mar 20 11:43:20 EDT 2024
|
| PROG
|
while (tt:=t*(t+1)//2)<an or not alldiff(s, str(t*(t+1)//2tt)): t += 1
an = t*(t+1)//2
an = tt
|
|
|
|
#18 by Michael S. Branicky at Wed Mar 20 11:42:37 EDT 2024
|
| LINKS
|
Michael S. Branicky, <a href="/A068855/b068855_12.txt">Table of n, a(n) for n = 1..20002500</a>
|
|
|
|
#17 by Michael S. Branicky at Wed Mar 20 09:43:02 EDT 2024
|
| LINKS
|
Michael S. Branicky, <a href="/A068855/b068855_1.txt">Table of n, a(n) for n = 1..2000</a>
|
|
|
|
#16 by Michael S. Branicky at Wed Mar 20 09:39:15 EDT 2024
|
| PROG
|
(Python)
from math import isqrt
from itertools import count, islice
def alldiff(s, t):
return all(s[-i]!=t[-i] for i in range(1, min(len(s), len(t))+1))
def diffgreater(n): # smallest number >n that differs from it in every digit
s = str(n)
f = str(int(s[0]) + 1)
return int(f + "".join(("0" if di != "0" else "1") for di in s[1:]))
def agen(): # generator of terms
an = 1
while True:
yield an
t, s = isqrt(2*diffgreater(an)), str(an)
while not alldiff(s, str(t*(t+1)//2)): t += 1
an = t*(t+1)//2
print(list(islice(agen(), 45))) # Michael S. Branicky, Mar 20 2024
|
| STATUS
|
approved
editing
|
|
|
|
#15 by Michel Marcus at Wed Dec 01 08:44:02 EST 2021
|
|
|
|
#14 by Alois P. Heinz at Wed Dec 01 08:36:22 EST 2021
|
|
|
Discussion
|
Wed Dec 01
| 08:43
| Michel Marcus: oh sorry.
|
| 08:43
| Michel Marcus: reverting
|
|
|
|
#13 by Michel Marcus at Wed Dec 01 05:33:58 EST 2021
|
|
|
Discussion
|
Wed Dec 01
| 08:36
| Alois P. Heinz: A068855 is not the same as A068865 ... where was the self-ref??
|
|
|
|