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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066801 A self-generating sequence: let S = {}, a(0) = 333; for n >= 1, factorize a(n-1), arrange prime factors in increasing order and append their digits to S; then a(n) is the 3-digit number formed from terms 3n, 3n+1, 3n+2 of S. Leading zeros are omitted from a(n). 1

%I #2 Sep 13 2003 03:00:00

%S 333,735,772,219,337,333,733,377,331,329,331,747,331,338,333,121,313,

%T 333,711,113,133,337,337,911,371,933,733,791,175,333,117,337,113,557,

%U 333,733,133,371,135,573,337,733,719,753,333,531,913,377,337,193,251

%N A self-generating sequence: let S = {}, a(0) = 333; for n >= 1, factorize a(n-1), arrange prime factors in increasing order and append their digits to S; then a(n) is the 3-digit number formed from terms 3n, 3n+1, 3n+2 of S. Leading zeros are omitted from a(n).

%C 333 is the unique 3-digit starting value that produces nontrivial sequences. This is one of the two possible continuations if one starts with 333. For the other see A066349.

%e The factorizations of the first few terms are 3*3*37, 3*5*7*7, 2*2*193, 3*73, 337, ... Thus S = [3,3,3,7,3,5,7,7,2,...] and grouping these in sets of three we recover the sequence.

%Y Cf. A066349.

%K base,easy,nice,nonn

%O 0,1

%A Evans A Criswell (criswell(AT)itsc.uah.edu), Dec 20 2001

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jul 03 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 17:23 EDT 2024. Contains 376002 sequences. (Running on oeis4.)