[go: up one dir, main page]

login
Revision History for A067442 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(1) = 1 and then smallest nontrivial n-th power starting with 1.
(history; published version)
#29 by Charles R Greathouse IV at Thu Sep 08 08:45:05 EDT 2022
PROG

(MAGMAMagma) m:=1; sol:=[1]; for n in [2..24] do k:=2; while Reverse(Intseq(k^n))[1] ne 1 do; k:=k+1; end while; sol[m+1]:=k^n; m:=m+1; end for; sol; // Marius A. Burtea, Aug 15 2019

Discussion
Thu Sep 08
08:45
OEIS Server: https://oeis.org/edit/global/2944
#28 by Sean A. Irvine at Sat Aug 24 05:51:55 EDT 2019
STATUS

proposed

approved

#27 by A.H.M. Smeets at Fri Aug 16 13:01:58 EDT 2019
STATUS

editing

proposed

#26 by A.H.M. Smeets at Fri Aug 16 13:01:52 EDT 2019
PROG

print(n, p**n) # A.H.M. Smeets, Aug 16 2019

#25 by A.H.M. Smeets at Fri Aug 16 13:01:18 EDT 2019
PROG

(Python)

print(1, 1)

n = 1

while n < 20:

n, p = n+1, 2

s = str(p**n)

while s[0] != "1":

p = p+1

s = str(p**n)

print(n, p**n) # A.H.M. Smeets, Aug 16 2019

STATUS

reviewed

editing

#24 by Michel Marcus at Fri Aug 16 00:11:39 EDT 2019
STATUS

proposed

reviewed

#23 by Marius A. Burtea at Thu Aug 15 16:01:12 EDT 2019
STATUS

editing

proposed

Discussion
Thu Aug 15
23:53
N. J. A. Sloane: Neil to Michel: is the Magma program OK now?
Fri Aug 16
00:11
Michel Marcus: yes fine
#22 by Marius A. Burtea at Thu Aug 15 16:00:37 EDT 2019
PROG

(MAGMA) m:=1; sol:=[1]; for u n in [2..24] do for k in [:=2..200] do d:=; while Reverse(Intseq(k^un)); if d[1] eq ne 1 do; k:=k+1 then ; end while; sol[m+1]:=k^un; m:=m+1; break; end if; end for; end for; sol; // Marius A. Burtea, Aug 15 2019

STATUS

proposed

editing

Discussion
Thu Aug 15
16:01
Marius A. Burtea: New MAGMA.
#21 by Marius A. Burtea at Thu Aug 15 15:38:19 EDT 2019
STATUS

editing

proposed

Discussion
Thu Aug 15
15:50
Michel Marcus: same question here as in A309707
#20 by Marius A. Burtea at Thu Aug 15 15:38:12 EDT 2019
PROG

(MAGMA) m:=1; sol:=[1]; for u in [2..24] do for k in [2..200] do d:=Reverse(Intseq(k^u)); if d[1] eq 1 then sol[m+1]:=k^u; m:=m+1; break; end if; end for; end for; sol; // Marius A. Burtea, Aug 15 2019