The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236295 Number of terms of A114440 that require n steps to arrive at 1. 2

%I

%S 1,8,14,15,17,21,23,21,22,27,27,30,32,26,20,23,25,22,17,20,22,32,41,

%T 34,35,38,43,45,49,51,52,43,44,41,51,40,38,37,30,30,35,26,24,24,30,22,

%U 21,25,21,18,24,19,25,23,23,22,31,22,27,28,25,21,21,25

%N Number of terms of A114440 that require n steps to arrive at 1.

%C Because A114440 is finite, this sequence is necessarily also finite. The sum of all 441 terms of this sequence, a(0) to a(440), is 15095, the number of terms in A114440.

%H Hans Havermann, <a href="/A236295/b236295.txt">Table of n, a(n) for n = 0..440</a>

%e There is 1 terms of A114440 that requires no steps to reach 1: {1}. So a(0) = 1.

%e There are 8 terms of A114440 that require one step to reach 1: {2,3,4,5,6,7,8,9}. So a(1) = 8.

%e There are 14 terms of A114440 that require two steps to reach 1: {12,18,21,24,27,36,42,45,48,54,63,72,81,84}. So a(2) = 14.

%e ...

%e There are 4 terms of A114440 that require 440 steps to reach 1, so a(440) = 4. There are no terms that require more than 440 steps to reach 1.

%Y Cf. A114440, A235601.

%K nonn,base,fini,full

%O 0,2

%A _Hans Havermann_, Jan 21 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 16:45 EST 2021. Contains 340247 sequences. (Running on oeis4.)