|
| |
|
|
A265899
|
|
After a(1) = 1, positions of descents in A265894.
|
|
5
|
|
|
|
1, 3, 6, 8, 11, 14, 17, 20, 24, 27, 31, 34, 38, 41, 45, 49, 53, 57, 61, 65, 69, 73, 77, 81, 85, 89, 94, 98, 102, 106, 111, 115, 120, 124, 128, 133, 137, 142, 146, 151, 156, 160, 165, 169, 174, 179, 184, 188, 193, 198, 202, 207, 212, 217, 222, 227, 231, 236, 241, 246, 251, 256, 261, 266, 271, 276, 281, 286, 291, 296, 301
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Numbers n for which A099563(A001813(n)) <= A099563(A001813(n-1)), where A001813(n) = (2n)! / n!, and A099563 gives the most significant digit in the factorial base representation (A007623) of n.
|
|
|
LINKS
|
Antti Karttunen, Table of n, a(n) for n = 1..1503
|
|
|
PROG
|
(PARI)
A099563(n) = { my(i=2, dig=0); until(0==n, dig = n % i; n = (n - dig)/i; i++); return(dig); };
A265894 = n -> A099563((2*n)! / n!);
i=0; p=1; n=0; while(i < 5000, n++; k = A265894(n); if(k <= p, i++; write("b265899.txt", i, " ", n)); p = k; );
(Scheme, with Antti Karttunen's IntSeq-library)
(define A265899 (MATCHING-POS 1 1 (lambda (n) (<= (A265894 n) (A265894 (- n 1))))))
|
|
|
CROSSREFS
|
Cf. A001813, A007623, A099563, A265894.
Cf. A265898 (a subsequence), A266119 (first differences), A266120 (terms immediately before descents).
Cf. also A031435.
Sequence in context: A022851 A325946 A050503 * A265898 A133869 A276573
Adjacent sequences: A265896 A265897 A265898 * A265900 A265901 A265902
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Antti Karttunen, Dec 24 2015
|
|
|
STATUS
|
approved
|
| |
|
|
