A236295 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A236295

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

1, 8, 14, 15, 17, 21, 23, 21, 22, 27, 27, 30, 32, 26, 20, 23, 25, 22, 17, 20, 22, 32, 41, 34, 35, 38, 43, 45, 49, 51, 52, 43, 44, 41, 51, 40, 38, 37, 30, 30, 35, 26, 24, 24, 30, 22, 21, 25, 21, 18, 24, 19, 25, 23, 23, 22, 31, 22, 27, 28, 25, 21, 21, 25

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

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.

LINKS

Hans Havermann, Table of n, a(n) for n = 0..440

EXAMPLE

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

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.

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.

...

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.

CROSSREFS

Cf. A114440, A235601.

Sequence in context: A122459 A092537 A226799 * A178838 A219303 A376519

Adjacent sequences: A236292 A236293 A236294 * A236296 A236297 A236298

KEYWORD

nonn,base,fini,full

AUTHOR

Hans Havermann, Jan 21 2014

STATUS

approved