[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

Showing entries 1-10 | older changes
a(1) = 1; a(n) = 1 + Product_{k=1..n-1} a(k) (mod n-1).
(history; published version)
#15 by N. J. A. Sloane at Tue Sep 08 03:29:23 EDT 2020
STATUS

proposed

approved

#14 by Michel Marcus at Sun Aug 23 04:04:18 EDT 2020
STATUS

editing

proposed

#13 by Michel Marcus at Sun Aug 23 04:04:12 EDT 2020
CROSSREFS

Cf. A129871 (without the mod operation).

#12 by Michel Marcus at Sun Aug 23 04:02:08 EDT 2020
PROG

(PARI) lista(nn) = {my(va = vector(nn)); va[1] = 1; for (n=2, nn, va[n] = 1 + prod(k=1, n-1, va[k]) % (n-1); ); va; } \\ Michel Marcus, Aug 23 2020

STATUS

proposed

editing

#11 by Michel Marcus at Sun Aug 23 01:19:12 EDT 2020
STATUS

editing

proposed

#10 by Michel Marcus at Sun Aug 23 01:19:08 EDT 2020
DATA

1, 1, 2, 3, 3, 4, 1, 3, 1, 1, 7, 6, 1, 12, 1, 10, 1, 12, 1, 3, 1, 1, 21, 12, 1, 6, 21, 1, 1, 15, 1, 20, 1, 31, 15, 1, 1, 32, 13, 1, 1, 18, 1, 7, 25, 1, 17, 38, 1, 1, 1, 1, 1, 26, 1, 6, 1, 1, 29, 47, 1, 42, 1, 1, 1, 1, 61, 26, 1, 25, 1, 21, 1, 64, 21, 1, 1, 29, 1, 18, 1, 1, 11, 21, 1, 1, 59, 1, 1, 39, 1, 1, 5, 1, 1, 1, 1, 32, 1, 1, 1, 42, 1, 9, 1, 1, 29, 55, 1, 44, 1

STATUS

proposed

editing

#9 by Matt Donahoe at Sat Aug 22 16:50:00 EDT 2020
STATUS

editing

proposed

Discussion
Sun Aug 23
01:17
Michel Marcus: I get 369 chars all included: it should be 260
#8 by Matt Donahoe at Sat Aug 22 16:49:14 EDT 2020
DATA

1, 1, 2, 3, 3, 4, 1, 3, 1, 1, 7, 6, 1, 12, 1, 10, 1, 12, 1, 3, 1, 1, 21, 12, 1, 6, 21, 1, 1, 15, 1, 20, 1, 31, 15, 1, 1, 32, 13, 1, 1, 18, 1, 7, 25, 1, 17, 38, 1, 1, 1, 1, 1, 26, 1, 6, 1, 1, 29, 47, 1, 42, 1, 1, 1, 1, 61, 26, 1, 25, 1, 21, 1, 64, 21, 1, 1, 29, 1, 18, 1, 1, 11, 21, 1, 1, 59, 1, 1, 39, 1, 1, 5, 1, 1, 1, 1, 32, 1, 1, 1, 42, 1, 9, 1, 1, 29, 55, 1, 44, 1

STATUS

proposed

editing

Discussion
Sat Aug 22
16:49
Matt Donahoe: I added more terms, but kept it under the 260 char limit as requested earlier.
#7 by Amiram Eldar at Sat Aug 22 16:21:30 EDT 2020
STATUS

editing

proposed

Discussion
Sat Aug 22
16:46
Omar E. Pol: Could you give us more terms? ( 3 1/2 lines in the Data section).
16:46
Omar E. Pol: Please.
#6 by Amiram Eldar at Sat Aug 22 16:21:26 EDT 2020
MATHEMATICA

a[1] = 1; a[n_] := a[n] = 1 + Mod[Product[a[k], {k, 1, n - 1}], n - 1]; Array[a, 100] (* Amiram Eldar, Aug 22 2020 *)

STATUS

proposed

editing