[go: up one dir, main page]

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

Showing entries 1-10 | older changes
Triangle read by rows: T(n,k) = least number m > 0 such that m^k in base n contains exactly k distinct digits, 1 <= k <= n.
(history; published version)
#16 by Bruno Berselli at Tue Feb 14 11:09:07 EST 2017
STATUS

proposed

approved

#15 by Indranil Ghosh at Tue Feb 14 10:37:53 EST 2017
STATUS

editing

proposed

#14 by Indranil Ghosh at Tue Feb 14 10:36:30 EST 2017
LINKS

Indranil Ghosh, <a href="/A247045/b247045.txt">Rows 1..36 of triangle, flattened</a>

STATUS

approved

editing

#13 by N. J. A. Sloane at Mon Sep 22 19:43:31 EDT 2014
STATUS

proposed

approved

#12 by Michel Marcus at Fri Sep 12 00:32:42 EDT 2014
STATUS

editing

proposed

#11 by Michel Marcus at Fri Sep 12 00:32:28 EDT 2014
KEYWORD

nonn,base,tabl,changed

STATUS

proposed

editing

Discussion
Fri Sep 12
00:32
Michel Marcus: so added tabl
#10 by Derek Orr at Thu Sep 11 14:29:40 EDT 2014
STATUS

editing

proposed

#9 by Derek Orr at Thu Sep 11 14:29:24 EDT 2014
DATA

1, 1, 2, 1, 3, 4, 1, 2, 3, 5, 1, 3, 3, 6, 12, 1, 3, 5, 7, 7, 15, 1, 3, 5, 9, 5, 17, 15, 1, 4, 5, 10, 9, 7, 11, 33, 1, 3, 5, 7, 11, 19, 14, 16, 53, 1, 4, 5, 6, 7, 13, 13, 14, 21, 36, 1, 4, 5, 7, 10, 8, 12, 12, 16, 42, 41, 1, 4, 6, 16, 11, 8, 19, 19, 16, 28, 35, 55, 1, 4, 6, 9, 9, 14, 10, 18, 14

OFFSET

1,23

EXAMPLE

1;

PROG

print1(1, ", "); n=2; while(n<20, m=1; for(k=1, n, while(m, d=digits(m^k, n); if(#vecsort(d, , 8)!=k, m++); if(#vecsort(d, , 8)==k, print1(m, ", "); m=1; break))); n++)

Discussion
Thu Sep 11
14:29
Derek Orr: Is this allowed? I added it and changed my program to account for it.
#8 by Derek Orr at Thu Sep 11 14:26:54 EDT 2014
NAME

Triangle read by rows: T(n,k) = least number m > 0 such that m^k in base n contains exactly k distinct digits, 1 <= k <= n.

STATUS

proposed

editing

#7 by Michel Marcus at Thu Sep 11 03:21:47 EDT 2014
STATUS

editing

proposed