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 A165263 #5 Jul 22 2025 07:20:33 %S A165263 0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,1,1,0 %N A165263 A sequence similar to the Fibonacci rabbit sequence for the Padovan sequence. %C A165263 Starting with 0,1 and using the maps 0->1 1->.10 and 10->01 Gives the subsequences 0,1,10,01,1.10,10.01,01.1.10,1.10.10.01 etc. The n-th subsequence has a 1 count equal to P(n) where P is the n-th Padovan sequence number (A000931) and a digit length P(n+2). This sequence represents the binary number formed by concatenating these sebsequences. Similar to how the Fibonacci rabbit constant is formed by the maps 0->1 1->10. %K A165263 nonn %O A165263 1,1 %A A165263 _John Lien_, Sep 12 2009