The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 11
 0, 2, 4, 8, 10, 12, 16, 20, 26, 28, 30, 34, 38, 42, 46, 52, 56, 62, 68, 72, 80, 82, 84, 88, 92, 96, 100, 106, 110, 116, 122, 126, 134, 140, 144, 152, 160, 164, 170, 176, 180, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Antti Karttunen, Table of n, a(n) for n = 0..6250 FORMULA a(n) = A276624(A276622(n)). Other identities. For all n >= 0: A261231(a(n)) = n. a(A261233(n)) = A024023(n) = 3^n - 1. PROG (Scheme) (define (A276623 n) (A276624 (A276622 n))) CROSSREFS Cf. A004128, A024023, A053735, A054861, A261231 (left inverse), A261233, A276622, A276624, A276603 (terms divided by 2), A276604 (first differences). Cf. A179016, A219648, A219666, A255056, A259934, A276573, A276583, A276613 for similar constructions. Cf. also A263273. Sequence in context: A140900 A166936 A166245 * A121519 A098968 A032368 Adjacent sequences:  A276620 A276621 A276622 * A276624 A276625 A276626 KEYWORD nonn,base AUTHOR Antti Karttunen, Sep 11 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.

Last modified April 14 07:29 EDT 2021. Contains 342946 sequences. (Running on oeis4.)