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!)
A039512 T(n,1..i) are attractors in '3x+(2n+1)' problem. 2

%I #6 Dec 19 2015 12:33:19

%S 1,3,1,5,19,23,187,347,5,7,9,1,11,13,1,13,131,211,227,251,259,283,287,

%T 319,3,15,57,69,561,1041,1,17,23,5,19,15,21,5,7,23,41,5,7,17,25,95,

%U 115,935,1735,27,1,11,29,3811,7055,13,31,3,33,39,7,13,17,25,35,133

%N T(n,1..i) are attractors in '3x+(2n+1)' problem.

%e 1; 3; 1,5,19,23,187,347; 5,7; 9; 1,11,13;...

%Y A039508 gives number of columns in each row. Cf. A039508-A039515.

%K nonn,tabf

%O 0,2

%A _Christian G. Bower_, Feb 15 1999

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