login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #13 Sep 12 2016 17:03:29

%S 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 92,96,100,106,110,116,122,126,134,140,144,152,160,164,170,176,180,

%U 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 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 Antti Karttunen, <a href="/A276623/b276623.txt">Table of n, a(n) for n = 0..6250</a>

%F a(n) = A276624(A276622(n)).

%F Other identities. For all n >= 0:

%F A261231(a(n)) = n.

%F a(A261233(n)) = A024023(n) = 3^n - 1.

%o (Scheme) (define (A276623 n) (A276624 (A276622 n)))

%Y Cf. A004128, A024023, A053735, A054861, A261231 (left inverse), A261233, A276622, A276624, A276603 (terms divided by 2), A276604 (first differences).

%Y Cf. A179016, A219648, A219666, A255056, A259934, A276573, A276583, A276613 for similar constructions.

%Y Cf. also A263273.

%K nonn,base

%O 0,2

%A _Antti Karttunen_, Sep 11 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)