login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275728 a(0) = 0, for n >= 1, a(n) = A275736(n) + a(A257684(n)); a(n) = A048675(A275734(n)). 6
0, 1, 2, 3, 1, 2, 4, 5, 6, 7, 5, 6, 2, 3, 4, 5, 3, 4, 1, 2, 3, 4, 2, 3, 8, 9, 10, 11, 9, 10, 12, 13, 14, 15, 13, 14, 10, 11, 12, 13, 11, 12, 9, 10, 11, 12, 10, 11, 4, 5, 6, 7, 5, 6, 8, 9, 10, 11, 9, 10, 6, 7, 8, 9, 7, 8, 5, 6, 7, 8, 6, 7, 2, 3, 4, 5, 3, 4, 6, 7, 8, 9, 7, 8, 4, 5, 6, 7, 5, 6, 3, 4, 5, 6, 4, 5, 1, 2, 3, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

See graph: pine trees on a snowy mountain. - N. J. A. Sloane, Aug 12 2016

LINKS

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

Index entries for sequences related to factorial base representation

FORMULA

a(0) = 0, for n >= 1, a(n) = A275736(n) + a(A257684(n)).

a(n) = A048675(A275734(n)).

PROG

(Scheme, with memoization-macro definec)

(definec (A275728 n) (if (zero? n) n (+ (A275736 n) (A275728 (A257684 n)))))

(define (A275728 n) (A048675 (A275734 n)))

CROSSREFS

Cf. A048675, A257684, A275734, A275736.

Cf. also A275727, A275808.

Sequence in context: A254112 A249111 A166871 * A081536 A297497 A152736

Adjacent sequences:  A275725 A275726 A275727 * A275729 A275730 A275731

KEYWORD

nonn,base,look

AUTHOR

Antti Karttunen, Aug 09 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 02:57 EST 2019. Contains 320364 sequences. (Running on oeis4.)