This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236833 a(n) = number of times n occurs in A234741. 9
 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 4, 1, 1, 2, 1, 1, 2, 1, 0, 1, 2, 1, 2, 2, 1, 1, 1, 4, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 4, 1, 2, 2, 0, 1, 3, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 1, 4, 1, 1, 3, 1, 2, 1, 1, 3, 1, 6, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS Number of distinct values k such that A234741(k) = n. LINKS Antti Karttunen, Table of n, a(n) for n = 0..8192 FORMULA a(2n) = a(n). This should also have a direct formula, mirroring the formula for A236853. Cf. also A236861. PROG (Scheme, counting cases empirically with a naive loop. A234742 gives an absolute upper bound for any inverse of A234741): (define (A236833 n) (let ((u (A234742 n))) (let loop ((k n) (ntimes 0)) (cond ((> k u) ntimes) ((= (A234741 k) n) (loop (+ k 1) (+ ntimes 1))) (else (loop (+ k 1) ntimes)))))) CROSSREFS A236834 gives the positions of zeros, A236835 the positions of terms larger than one, A236841 the positions of terms other than zero. Cf. A234741, A236853, A236861. Sequence in context: A277873 A032542 A107038 * A043278 A125238 A025896 Adjacent sequences:  A236830 A236831 A236832 * A236834 A236835 A236836 KEYWORD nonn AUTHOR Antti Karttunen, Jan 31 2014 STATUS approved

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 July 15 16:09 EDT 2019. Contains 325049 sequences. (Running on oeis4.)