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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A280055 Nachos sequence based on 1 plus primes (A008578). 4
 1, 2, 1, 2, 3, 1, 2, 3, 2, 3, 1, 2, 3, 2, 3, 4, 2, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4, 2, 3, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4, 2, 3, 4, 3, 4, 5, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4, 2, 3, 4, 3, 4, 5, 3, 2, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4, 2, 3, 4, 3, 4, 5, 3, 2, 3, 4, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Like A280053 but based on 1,2,3,5,7,11,... rather than squares. See that entry for further information. Equivalently, greedily subtract terms of A014284 from n until reaching 0; a(n) = number of steps required. LINKS Lars Blomberg, Table of n, a(n) for n = 1..10000 EXAMPLE 26 takes 4 phases to read 0: subtract leaves 1   25 2   23 3   20 5   15 7   8 ------ 1   7 2   5 3   2 ------ 1   1 ------ 1   0 so a(26) = 4 MAPLE A280055 := proc(n)     local a, nres, i ;     a := 0 ;     nres := n;     while nres > 0 do         for i from 1 do             if A014284(i) > nres then                 break;             end if;         end do:         nres := nres-A014284(i-1) ;         a := a+1 ;     end do:     a ; end proc: seq(A280055(n), n=1..80) ; # R. J. Mathar, Mar 05 2017 CROSSREFS Cf. A280055, A014284. For records see A280760. Sequence in context: A061336 A057945 A285730 * A253092 A194546 A115452 Adjacent sequences:  A280052 A280053 A280054 * A280056 A280057 A280058 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 08 2017 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 April 16 07:59 EDT 2021. Contains 343030 sequences. (Running on oeis4.)