The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A093314 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A093314

Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 3 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.
(history; published version)

#5 by Alois P. Heinz at Tue Feb 05 15:12:46 EST 2019

STATUS

proposed

approved

#4 by Michel Marcus at Tue Feb 05 12:39:24 EST 2019

STATUS

editing

proposed

#3 by Michel Marcus at Tue Feb 05 12:39:18 EST 2019

REFERENCES

Matthijs Coster, Problem 2001/3-A of the Universitaire Wiskunde Competitie, Nieuw Arch. Wisk. 5/3 (2002), 92-94.

LINKS

Matthijs Coster, <a href="http://www.nieuwarchief.nl/serie5/pdf/naw5-2002-03-1-092.pdf">Problem 2001/3-A of the Universitaire Wiskunde Competitie</a>, Nieuw Arch. Wisk. 5/3 (2002), 92-94.

KEYWORD

nonn,more

STATUS

approved

editing

#2 by Russ Cox at Sat Mar 31 20:02:07 EDT 2012

AUTHOR

_Matthijs Coster (matthijs(AT)coster.demon.nl), _, Apr 26 2004

Discussion

Sat Mar 31

20:02

OEIS Server: https://oeis.org/edit/global/1010

#1 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

NAME

Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 3 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.

DATA

0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 12, 20, 20, 1, 163, 55

OFFSET

1,35

COMMENTS

The beginning elements of the permutation are 3,1,(either 2 or 4),...

The total number of permutations with this property is given in A067957.

REFERENCES

Matthijs Coster, Problem 2001/3-A of the Universitaire Wiskunde Competitie, Nieuw Arch. Wisk. 5/3 (2002), 92-94.

LINKS

Matthijs Coster, <a href="http://www.coster.demon.nl/sequences.htm">Sequences</a>

CROSSREFS

Cf. A067957, A093313, A093315.

KEYWORD

nonn

AUTHOR

Matthijs Coster (matthijs(AT)coster.demon.nl), Apr 26 2004

STATUS

approved