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 A276623 #13 Sep 12 2016 17:03:29 %S A276623 0,2,4,8,10,12,16,20,26,28,30,34,38,42,46,52,56,62,68,72,80,82,84,88, %T A276623 92,96,100,106,110,116,122,126,134,140,144,152,160,164,170,176,180, %U A276623 188,194,198,204,212,216,224,232,242,244,246,250,254,258,262,268,272,278,284,288,296,302,306,314,322,326,332,338,342,350,356,360 %N A276623 The infinite trunk of ternary beanstalk: The only infinite sequence such that a(n-1) = a(n) - A053735(a(n)), where A053735(n) = base-3 digit sum of n. %H A276623 Antti Karttunen, <a href="/A276623/b276623.txt">Table of n, a(n) for n = 0..6250</a> %F A276623 a(n) = A276624(A276622(n)). %F A276623 Other identities. For all n >= 0: %F A276623 A261231(a(n)) = n. %F A276623 a(A261233(n)) = A024023(n) = 3^n - 1. %o A276623 (Scheme) (define (A276623 n) (A276624 (A276622 n))) %Y A276623 Cf. A004128, A024023, A053735, A054861, A261231 (left inverse), A261233, A276622, A276624, A276603 (terms divided by 2), A276604 (first differences). %Y A276623 Cf. A179016, A219648, A219666, A255056, A259934, A276573, A276583, A276613 for similar constructions. %Y A276623 Cf. also A263273. %K A276623 nonn,base %O A276623 0,2 %A A276623 _Antti Karttunen_, Sep 11 2016