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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230407 Absolute value of a(n) tells the size of the n-th side-tree ("tendril", A230430(n)) in the factorial beanstalk; the sign tells on which side of the infinite trunk (A219666) it is. 6
0, -1, 1, 3, -5, -1, 3, 1, 3, -5, -1, 7, -1, -5, -1, -5, 5, 5, -5, -11, 1, 3, -11, 1, -3, 3, 1, 3, -5, -1, 7, -1, -5, -1, -5, 5, 5, -5, -11, 1, 3, -21, 1, -3, -3, 9, 1, -1, -5, -1, -5, 5, 5, -5, -11, 1, 3, -21, 1, -3, -3, -11, -1, -9, -3, 5, 5, -5, -11, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Positive and negative terms correspond to the tendrils that sprout respectively at the left and right sides of the infinite trunk, when the factorial beanstalk is drawn with the lesser numbers branching to the left. The absolute values give the sizes of those tendrils, with all nodes included: The leaves, the internal vertices as well as the root itself (which is at A230430(n)).

Here a(0) = 0 is a special case, as the infinite trunk starts to grow from its child 1, while the other child is 0 itself. (For both k=0 or k=1 it is true that A219651(k)=0).

This sequence relates to the factorial base representation (A007623) in the same way as A218618 relates to the binary system.

LINKS

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

FORMULA

a(n) = ((-1)^A230430(n)) * A230427(A230430(n)).

PROG

(Scheme)

(define (A230407 n) (* (expt -1 (A230430 n)) (A230427 (A230430 n))))

CROSSREFS

Partial sums: A230408, A230409.

Sequence in context: A226278 A005699 A127250 * A137759 A049246 A231186

Adjacent sequences:  A230404 A230405 A230406 * A230408 A230409 A230410

KEYWORD

sign

AUTHOR

Antti Karttunen, Nov 10 2013

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 November 13 00:25 EST 2019. Contains 329083 sequences. (Running on oeis4.)