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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A304590 a(1) = a(2) = a(3) = a(5) = 1, a(4) = 2, a(6) = 3; a(n) = a(n-a(n-3)) + a(n-a(n-6)) for n > 6. 1
1, 1, 1, 2, 1, 3, 4, 8, 11, 11, 12, 12, 12, 4, 3, 3, 13, 6, 7, 7, 9, 10, 14, 9, 9, 19, 12, 13, 14, 15, 16, 18, 15, 15, 22, 18, 19, 10, 18, 18, 23, 18, 18, 24, 24, 26, 23, 24, 30, 31, 24, 29, 25, 30, 28, 25, 27, 29, 30, 30, 33, 37, 33, 38, 35, 33, 29, 31, 36, 41, 36, 36, 42, 28, 36, 37, 53, 36, 37, 41, 48, 48, 33 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Altug Alkan, Table of n, a(n) for n = 1..10000

MAPLE

f:= proc(n) option remember; procname(n-procname(n-3))+procname(n-procname(n-6)) end proc:

for i from 1 to 6 do f(i):= [1, 1, 1, 2, 1, 3][i] od:

map(f, [$1..100]); # Robert Israel, May 16 2018

MATHEMATICA

Nest[Append[#2, #2[[#1 - #2[[-3]] ]] + #2[[#1 - #2[[-6]] ]] ] & @@ {Length@ # + 1, #} &, {1, 1, 1, 2, 1, 3}, 77] (* Michael De Vlieger, Jul 20 2018 *)

PROG

(PARI) q=vector(100); q[1]=q[2]=q[3]=q[5]=1; q[4]=2; q[6]=3; for(n=7, #q, q[n]=q[n-q[n-3]]+q[n-q[n-6]]); q

(GAP) a:=[1, 1, 1, 2, 1, 3];; for n in [7..100] do a[n]:=a[n-a[n-3]]+a[n-a[n-6]]; od; a; # Muniru A Asiru, May 19 2018

CROSSREFS

Cf. A005185, A063882, A087777, A240827.

Sequence in context: A267551 A055391 A177940 * A134876 A019612 A007444

Adjacent sequences:  A304587 A304588 A304589 * A304591 A304592 A304593

KEYWORD

nonn

AUTHOR

Altug Alkan, May 15 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 03:12 EDT 2020. Contains 334828 sequences. (Running on oeis4.)