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 A356965 #11 Sep 11 2022 06:13:23 %S A356965 0,1,2,3,4,5,6,0,8,9,10,11,12,0,1,15,16,17,18,19,13,21,22,23,0,1,2,3, %T A356965 28,29,30,24,32,33,34,35,36,24,25,39,40,41,42,43,0,1,2,3,4,5,6,7,52, %U A356965 53,54,55,56,44,45,59,60,61,62,63,57,65,66,67,44,45,46 %N A356965 a(n) is the sum of the tribonacci numbers in common in the greedy and lazy tribonacci representations of n. %C A356965 This sequence is to tribonacci numbers (A000073) what A356771 is to Fibonacci numbers (A000045). %H A356965 Rémy Sigrist, <a href="/A356965/b356965.txt">Table of n, a(n) for n = 0..10609</a> %H A356965 Rémy Sigrist, <a href="/A356965/a356965.gp.txt">PARI program</a> %H A356965 <a href="/index/Z#Zeckendorf">Index entries for sequences related to Zeckendorf expansion of n</a> %F A356965 a(n) = A356964(A003796(n+1) AND A003726(n+1)) (where AND denotes the bitwise AND operator). %F A356965 a(n) <= n with equality iff n belongs to A356899. %F A356965 a(n) = 0 iff n belongs to A356966. %e A356965 For n = 58: %e A356965 - with T = A000073, %e A356965 - the greedy representation of 58 is: T(9) + T(7) + T(3), %e A356965 - the lazy representation of 58 is: T(9) + T(6) + T(5) + T(4) + T(3), %e A356965 - so a(59) = T(9) + T(3) = 45. %o A356965 (PARI) See Links section. %Y A356965 Cf. A000045, A000073, A003726, A003796, A356771, A356899, A356964, A356966. %K A356965 nonn,base %O A356965 0,3 %A A356965 _Rémy Sigrist_, Sep 06 2022