|
| |
|
|
A213733
|
|
Positions of odd numbers in A179016.
|
|
7
|
|
|
|
1, 2, 4, 6, 7, 9, 10, 12, 14, 15, 18, 19, 20, 21, 23, 24, 27, 28, 29, 31, 32, 34, 38, 40, 41, 44, 45, 46, 48, 49, 51, 56, 57, 59, 60, 61, 62, 63, 64, 67, 68, 70, 71, 74, 75, 76, 78, 79, 81, 86, 87, 89, 90, 91, 92, 93, 94, 97, 99, 100, 102, 103, 104, 105, 106
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
These are exactly the positions in the infinite trunk of beanstalk (see A179016 and A213729) where the node is the larger of the two possible branches from one node below. See the explanation at example-lines.
|
|
|
LINKS
|
Antti Karttunen, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
|
a(n) = A218773(n)+1.
|
|
|
EXAMPLE
|
A179016(1) = 1 is the first case where the infinite trunk has continued to the larger of two branches of the predecessor node. (In this case the predecessor node is A179016(0)=0, for which hold both 0+A000120(0)=0+0=0 (the smaller branch, leading exceptionally back to the same node) and 0+A000120(1)=0+1=1 (the larger branch). Thus the first term of this sequence is 1.
A179016(2) = 3 is the second case where the infinite trunk has continued to the larger of two branches of the predecessor node (In this case the predecessor node is A179016(1)=1, for which hold both 1+A000120(2)=1+1=2 (the smaller branch) and 1+A000120(3)=1+2=3 (the larger branch). Thus the second term of this sequence is 2.
|
|
|
PROG
|
(Scheme): (define (A213733 n) (1+ (A218773 n)))
|
|
|
CROSSREFS
|
Complement of A213732. First differences: A218775. Characteristic function: A213729.
Sequence in context: A247910 A189407 A189518 * A218608 A288475 A080711
Adjacent sequences: A213730 A213731 A213732 * A213734 A213735 A213736
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Antti Karttunen, Nov 01 2012
|
|
|
EXTENSIONS
|
Description changed because of the changed starting offset of A179016. - Antti Karttunen, Nov 05 2012
|
|
|
STATUS
|
approved
|
| |
|
|
