This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A218605 #21 Mar 08 2025 14:57:08 %S A218605 1,2,4,6,9,14,23,34,36,37,38,40,51,53,54,55,56,59,70,81,83,84,85,86, %T A218605 89,102,119,124,135,137,138,139,140,143,156,173,180,197,208,213,222, %U A218605 233,235,236,237,238,241,254,271,278,295,306,311,322,339,350,355,370,375 %N A218605 a(n) = A218607(n-1) + 1. %C A218605 These are the points i for which the predecessor node (i.e. the vertex that is one step towards the root) in the infinite trunk of beanstalk (A179016(i)) is at the least possible position of its allotted "window" which it at that point must pass through. (See comments at A218603 and A218607.) %H A218605 Antti Karttunen, <a href="/A218605/b218605.txt">Table of n, a(n) for n = 1..7949</a> %F A218605 a(n) = A218607(n-1) + 1. %o A218605 (Scheme) (define (A218605 n) (1+ (A218607 (-1+ n)))) %Y A218605 Cf. A218603, A218606, A218607. %K A218605 nonn %O A218605 1,2 %A A218605 _Antti Karttunen_, Nov 03 2012 %E A218605 Definition changed because of the changed offset of A218603. - _Antti Karttunen_, Nov 10 2012