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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A356294 a(n) = A054633(n) if A030190(n) = 1, else a(n) = a(n-A054633(n)+1). 1
 1, 2, 1, 3, 4, 5, 2, 1, 6, 3, 7, 8, 9, 4, 10, 11, 12, 13, 5, 2, 1, 14, 6, 3, 15, 16, 7, 17, 8, 18, 9, 19, 20, 21, 22, 4, 10, 23, 24, 11, 25, 26, 27, 28, 12, 29, 30, 31, 32, 33, 13, 5, 2, 1, 34, 14, 6, 3, 35, 36, 15, 16, 37, 7, 38, 17, 8, 39, 40, 41, 18, 42, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..73. Michael De Vlieger, Log-log scatterplot of a(n), n = 1..2^20, with a color function representing the number k of appearances of m in a(n), where red represents the first appearance of m, and magenta the maximum number of appearances of m in a(1..2^20). MATHEMATICA nn = 120; c = k = 1; Do[Do[Set[b[k], #[[j]]]; If[b[k] == 1, Set[a[k], c]; c++, Set[a[k], a[k - c + 1]]]; k++, {j, Length[#]}] &@ IntegerDigits[n, 2], {n, nn}]; Array[a[#] &, k - 1] (* Michael De Vlieger, Aug 03 2022 *) CROSSREFS Cf. A030190, A054633. Sequence in context: A331744 A323892 A318311 * A338091 A284584 A256100 Adjacent sequences: A356291 A356292 A356293 * A356295 A356296 A356297 KEYWORD nonn,easy,base,look AUTHOR Michael De Vlieger and David James Sycamore, Aug 03 2022 STATUS approved

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.

Last modified December 4 16:44 EST 2023. Contains 367563 sequences. (Running on oeis4.)