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!)
A065842 a(1) = 1; a(2) = 2; a(3) = 3; a(n) is concatenation of a(n-3), a(n-2) and a(n-1); the digits on the right of the first 3 (if any) are then swapped with the digits on the left. 1

%I #12 Sep 16 2023 21:03:06

%S 1,2,3,123,12323,123123233,12323123123233123,

%T 2312312323312323123123233123123,

%U 123233123231231232331232312312323312323123123233123123123

%N a(1) = 1; a(2) = 2; a(3) = 3; a(n) is concatenation of a(n-3), a(n-2) and a(n-1); the digits on the right of the first 3 (if any) are then swapped with the digits on the left.

%D C. A. Pickover, "Wonders of Numbers", Oxford University Press, 2001, chapter 122 '3 Weird Problems with 3 - Cleavage', pp. 272-274, 378.

%H C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," <a href="http://www.zentralblatt-math.org/zmath/en/search/?q=an:0983.00008&amp;format=complete">Zentralblatt review</a>

%Y Cf. A065841, A001590.

%K nonn,base

%O 1,2

%A _Patrick De Geest_, Nov 27 2001

%E Offset and a(7) onward corrected by _Sean A. Irvine_, Sep 16 2023

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 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)