A275853 a(n) = A060502(n) + A275851(n).

1, 1, 2, 2, 2, 1, 3, 2, 3, 3, 3, 2, 3, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1, 4, 3, 3, 3, 3, 2, 4, 3, 4, 4, 4, 3, 4, 4, 3, 3, 3, 3, 4, 3, 3, 3, 3, 2, 4, 3, 4, 4, 4, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 2, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 4, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 2, 3, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1, 5

Offset

0,3

Comments

These are averages (number of balls) in siteswap-patterns constructed like in A060498, but with 0's replaced by the length of the pattern.

Links

Antti Karttunen, Table of n, a(n) for n = 0..40320

Index entries for sequences related to factorial base representation

Formula

a(n) = A060502(n) + A275851(n).

Prog

(Scheme) (define (A275853 n) (+ (A060502 n) (A275851 n)))

Crossrefs

Cf. A060498, A060500, A060501, A060502, A275849, A275851.

Sequence in context: A064659 A349520 A325034 * A324100 A127953 A260418

Adjacent sequences: A275850 A275851 A275852 * A275854 A275855 A275856

Keyword

nonn,base

Author

Antti Karttunen, Aug 15 2016

Status

approved