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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A343265 a(n) is the number of ways n can be reached starting from 0 and using only two operations: adding one or, once n > 1, squaring. 0
 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Table of n, a(n) for n=0..80. FORMULA a(n) = a(n-1) + a(sqrt(n)) if n is a square or a(n-1) otherwise. MATHEMATICA a[0]:=1; a[n_]:=If[IntegerQ[Sqrt[n]], a[n-1]+a[Sqrt[n]], a[n-1]]; Table[a[n], {n, 0, 80}] (* Stefano Spezia, May 06 2021 *) CROSSREFS Cf. A097046. Sequence in context: A350174 A000196 A111850 * A059396 A108602 A305025 Adjacent sequences: A343262 A343263 A343264 * A343266 A343267 A343268 KEYWORD nonn AUTHOR James P. B. Hall, Apr 09 2021 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 April 21 13:26 EDT 2024. Contains 371870 sequences. (Running on oeis4.)