|
|
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
|
|
|
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
|
local a, nres, i ;
a := 0 ;
nres := n;
while nres > 0 do
for i from 1 do
break;
end if;
end do:
a := a+1 ;
end do:
a ;
end proc:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|