<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Popcorn Discussions Week Ending 10/28/22 by Felix Mariano</title>
      <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3</link>
      <description>Write your response to the topic on every column as well as your reactions to other classmate comments</description>
      <language>en-us</language>
      <pubDate>2022-10-23 16:01:10 UTC</pubDate>
      <lastBuildDate>2022-11-25 21:32:49 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet.net/icons/png/1f9d4.png</url>
      </image>
      <item>
         <title></title>
         <author>eoliverogenao</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353909872</link>
         <description><![CDATA[<div>Examples: arithmetic,3,5,7,9   geometry  3,6,9,12,15  fibonnacci  1,1,2,3,5</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:09:56 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353909872</guid>
      </item>
      <item>
         <title>Rueucris</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353913535</link>
         <description><![CDATA[<div><strong>Arithmetic Sequences<br>1,2,3,4,5,6<br>F(n)=1 plus F(n-1)<br>Graph</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:12:06 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353913535</guid>
      </item>
      <item>
         <title>Leslie</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353913983</link>
         <description><![CDATA[<div>&nbsp;A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:12:22 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353913983</guid>
      </item>
      <item>
         <title>Kimora</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353914568</link>
         <description><![CDATA[<div>&nbsp;A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:12:41 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353914568</guid>
      </item>
      <item>
         <title>Tiona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353915265</link>
         <description><![CDATA[<div>&nbsp;A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:13:04 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353915265</guid>
      </item>
      <item>
         <title>James</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353915801</link>
         <description><![CDATA[<div><strong>Arithmetic Sequences<br>1,2,3,4,5,6<br>F(n)=1 plus F(n-1)<br>Graph as well<br></strong><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:13:25 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353915801</guid>
      </item>
      <item>
         <title>Mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353915813</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:13:25 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353915813</guid>
      </item>
      <item>
         <title>Allison</title>
         <author>avasquez248</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353916021</link>
         <description><![CDATA[<div>&nbsp;A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:13:32 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353916021</guid>
      </item>
      <item>
         <title>Justin </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353916971</link>
         <description><![CDATA[<div>&nbsp;A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:14:03 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353916971</guid>
      </item>
      <item>
         <title>sharniece</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353917300</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;<br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:14:14 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353917300</guid>
      </item>
      <item>
         <title>amanda </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353919628</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences 3,9,27,81<strong>,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:15:34 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353919628</guid>
      </item>
      <item>
         <title>Fabian</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353920247</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:15:57 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353920247</guid>
      </item>
      <item>
         <title>Franky</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353922757</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and Fibonacci sequences&nbsp; 0, 1, 1, 2, 3, 5.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:17:26 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353922757</guid>
      </item>
      <item>
         <title>chris</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353923095</link>
         <description><![CDATA[<div>&nbsp;<strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:17:37 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353923095</guid>
      </item>
      <item>
         <title>scarlen orozco</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353925809</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and Fibonacci sequences&nbsp; 0, 1, 1, 2, 3, 5.&nbsp;</div><div><br></div>]]></description>
         <enclosure url="https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353922757" />
         <pubDate>2022-10-24 16:18:57 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353925809</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353926289</link>
         <description><![CDATA[<div>A sequence can be arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and neither sequences&nbsp; 0, 1, 1, 2, 3, 5.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:19:15 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353926289</guid>
      </item>
      <item>
         <title>Zavier</title>
         <author>zpolanco</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353932478</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and Fibonacci sequences</div><div>0, 1, 1, 2, 3, 5.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-24 16:22:38 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2353932478</guid>
      </item>
      <item>
         <title>Kiara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355728388</link>
         <description><![CDATA[<div>A sequence can be arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and neither sequences&nbsp; 0, 1, 1, 2, 3, 5.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:02:05 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355728388</guid>
      </item>
      <item>
         <title>a sequence can be represented in an arithmetic geometric and fiberoptic  </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355738254</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:07:07 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355738254</guid>
      </item>
      <item>
         <title>Allison</title>
         <author>avasquez248</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355744360</link>
         <description><![CDATA[<div>The definition of a recursive sequence helps you determine if a sequence is arithmetic, geometric or neither because it tells you previous term and the rule/pattern. </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:10:31 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355744360</guid>
      </item>
      <item>
         <title>Kimora</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355748238</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>. If you know the nth term of an arithmetic sequence and you know the common difference , d , you can find the (n+1)th term using the recursive formula an+1=an+d .</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:12:41 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355748238</guid>
      </item>
      <item>
         <title>Rueucris</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355752056</link>
         <description><![CDATA[<div>we know a sequence is arithmetic the formula should have a plus sign in it and when its a geometric one the number is next to the letter in the formula for example 5f(n-1)</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:14:48 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355752056</guid>
      </item>
      <item>
         <title>Cipriano</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355752337</link>
         <description><![CDATA[<div>The definition of a recursive<br>sequence helps you determine if a<br>sequence is arithmetic, geometric<br>or neither because it tells you<br>previous term and the rule/pattern.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:14:58 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355752337</guid>
      </item>
      <item>
         <title>Christopher R.</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355753928</link>
         <description><![CDATA[<div>you can use a recursive definition to determine the sequence because terms are defined using one or more previous terms which are shown, so you can use that to figure out the other sequence.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:15:53 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355753928</guid>
      </item>
      <item>
         <title></title>
         <author>eoliverogenao</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355754378</link>
         <description><![CDATA[<div>Is to define the sequence to understand the method that we are using </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:16:08 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355754378</guid>
      </item>
      <item>
         <title>sharniece</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355755222</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>. If you know the nth term of an arithmetic sequence and you know the common difference , d , you can find the (n+1)th term using the recursive formula an+1=an+d .</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:16:32 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355755222</guid>
      </item>
      <item>
         <title>Leslie</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355755604</link>
         <description><![CDATA[<div>An arithmetic sequence has a constant difference between each consecutive pair of terms. This is similar to the linear functions that have the form y=mx+b. A geometric sequence has a constant ratio between each pair of consecutive terms.</div><div><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:16:45 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355755604</guid>
      </item>
      <item>
         <title>scarlen</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355756321</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>. If you know the nth term of an arithmetic sequence and you know the common difference , d , you can find the (n+1)th term using the recursive formula an+1=an+d .</div><div><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:17:08 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355756321</guid>
      </item>
      <item>
         <title>Franky</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355756516</link>
         <description><![CDATA[<div>The definition of a recursive<br>sequence helps you determine if a<br>sequence is arithmetic, geometric<br>or neither because it tells you<br>previous term and the rule/pattern.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:17:15 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355756516</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355765490</link>
         <description><![CDATA[<div>&nbsp;A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:22:13 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355765490</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355766617</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>. If you know the nth term of an arithmetic sequence and you know the common difference , d , you can find the (n+1)th term using the recursive formula an+1=an+d .</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:22:52 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355766617</guid>
      </item>
      <item>
         <title>kiara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355779903</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:30:23 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355779903</guid>
      </item>
      <item>
         <title>Maya</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355804063</link>
         <description><![CDATA[<div><strong>An arithmetic sequence has a constant difference between each consecutive pair of terms</strong>. This is similar to the linear functions that have the form y=mx+b. A geometric sequence has a constant ratio between each pair of consecutive terms</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:43:49 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355804063</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355822668</link>
         <description><![CDATA[<div>A sequence can be arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and neither sequences&nbsp; 0, 1, 1, 2, 3, 5.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:54:55 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355822668</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355823460</link>
         <description><![CDATA[<div><strong>An arithmetic sequence has a constant difference between each consecutive pair of terms</strong>. This is similar to the linear functions that have the form y=mx+b. A geometric sequence has a constant ratio between each pair of consecutive terms</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-25 16:55:23 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2355823460</guid>
      </item>
      <item>
         <title>Allison</title>
         <author>avasquez248</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357443531</link>
         <description><![CDATA[<div>I would describe a recursive sequence as a sequence in which terms are defined using one or more previous terms that are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 14:53:52 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357443531</guid>
      </item>
      <item>
         <title>scarlen </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357584198</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:13:01 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357584198</guid>
      </item>
      <item>
         <title>Rueucris</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587115</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:14:38 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587115</guid>
      </item>
      <item>
         <title>james </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587409</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:14:48 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587409</guid>
      </item>
      <item>
         <title>Tiona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587692</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:14:53 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587692</guid>
      </item>
      <item>
         <title>Fabian</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587857</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:14:59 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587857</guid>
      </item>
      <item>
         <title>Christopher R.</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587899</link>
         <description><![CDATA[<div>3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and Fibonacci sequences&nbsp; 0, 1, 1, 2, 3, 5.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:15:01 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357587899</guid>
      </item>
      <item>
         <title>Justin </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357588199</link>
         <description><![CDATA[<div><strong>An arithmetic sequence has a constant difference between each consecutive pair of terms</strong>. This is similar to the linear functions that have the form y=mx+b. A geometric sequence has a constant ratio between each pair of consecutive terms.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:15:08 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357588199</guid>
      </item>
      <item>
         <title>Kimora </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357588223</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:15:09 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357588223</guid>
      </item>
      <item>
         <title>Franky</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357589281</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:15:46 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357589281</guid>
      </item>
      <item>
         <title>Justin </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357589811</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:16:04 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357589811</guid>
      </item>
      <item>
         <title>Samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357589846</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:16:05 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357589846</guid>
      </item>
      <item>
         <title>Leslie</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357590153</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:16:17 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357590153</guid>
      </item>
      <item>
         <title>Christopher R.</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357590375</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:16:26 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357590375</guid>
      </item>
      <item>
         <title>cipriano</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357591030</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:16:50 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357591030</guid>
      </item>
      <item>
         <title>nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357591108</link>
         <description><![CDATA[<div><strong>An arithmetic sequence has a constant difference between each consecutive pair of terms</strong>. This is similar to the linear functions that have the form y=mx+b. A geometric sequence has a constant ratio between each pair of consecutive terms</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:16:53 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357591108</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357591742</link>
         <description><![CDATA[<div>I would describe the recursive definition of a sequence as a pattern of terms that keeps going by the term. </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:17:16 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357591742</guid>
      </item>
      <item>
         <title>nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357592180</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:17:31 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357592180</guid>
      </item>
      <item>
         <title>Maya</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357592515</link>
         <description><![CDATA[<div>is <strong>a sequence of numbers indexed by an integer and generated by solving a recurrence equation</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:17:43 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357592515</guid>
      </item>
      <item>
         <title>Zavier</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357592805</link>
         <description><![CDATA[<div>A recursive sequence is one in which terms are defined by reference to one or more previously defined terms.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:17:54 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357592805</guid>
      </item>
      <item>
         <title></title>
         <author>eoliverogenao</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357594174</link>
         <description><![CDATA[<div>I describe the recursive definition like term can using more and different way of example can use.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:18:39 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357594174</guid>
      </item>
      <item>
         <title>nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357595076</link>
         <description><![CDATA[<div>A sequence can be arithmetic sequences 3, 9, 15, 21, 27, geometric sequences 2, 6, 18, 54, and neither sequences&nbsp; 0, 1, 1, 2, 3, 5.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:19:11 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357595076</guid>
      </item>
      <item>
         <title>James</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357597246</link>
         <description><![CDATA[<div>A recursive sequence is one in which terms are defined by reference to one or more previous defined terms.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:20:22 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357597246</guid>
      </item>
      <item>
         <title>Amanda </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357603656</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.<br><em>c</em>(1)=5</div><div><br></div><div><em>c</em>(<em>n</em>)=<em>c</em>(<em>n</em>−1)+3</div><div>​</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:24:06 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357603656</guid>
      </item>
      <item>
         <title>Sharniece </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357617254</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:32:39 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357617254</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357629296</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.<br><em>c</em>(1)=5</div><div><br></div><div><em>c</em>(<em>n</em>)=<em>c</em>(<em>n</em>−1)+3</div><div>​</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 16:40:00 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357629296</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357674239</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-26 17:06:41 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357674239</guid>
      </item>
      <item>
         <title>Franky </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359328280</link>
         <description><![CDATA[<div>The&nbsp;Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2. Plus it looks like a weird wave.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-27 16:02:25 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359328280</guid>
      </item>
      <item>
         <title>James</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359339202</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2. </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-27 16:09:32 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359339202</guid>
      </item>
      <item>
         <title>Christopher R.</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359340280</link>
         <description><![CDATA[<div>The Fibonacci sequence is a set of integers that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-27 16:10:17 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359340280</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359353173</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-27 16:18:59 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359353173</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359381628</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-27 16:37:22 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359381628</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359409443</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-27 16:56:23 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359409443</guid>
      </item>
      <item>
         <title>maya</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359890596</link>
         <description><![CDATA[<div>a sequence that can be arithmetic sequences 3,9,15,21,27 geometric sequence 2,6,18,54, and neither sequence 0,1,1,2,3,5</div>]]></description>
         <enclosure url="https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2357595076" />
         <pubDate>2022-10-28 01:14:19 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359890596</guid>
      </item>
      <item>
         <title>maya</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359893792</link>
         <description><![CDATA[<div>The Fibonacci sequence is <strong>a set of integers  that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-28 01:16:44 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2359893792</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2360566582</link>
         <description><![CDATA[<div>An arithmetic sequence has a constant difference between each consecutive pair of terms. A geometric sequence has a constant ratio between each pair of consecutive terms.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-28 12:50:31 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2360566582</guid>
      </item>
      <item>
         <title>sharniece</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2360577770</link>
         <description><![CDATA[<div>The Fibonacci sequence is <strong>a set of integers that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-28 12:59:32 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2360577770</guid>
      </item>
      <item>
         <title>Allison</title>
         <author>avasquez248</author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2360601292</link>
         <description><![CDATA[<div>The Fibonacci sequence is <strong>a set of integers that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-28 13:18:15 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2360601292</guid>
      </item>
      <item>
         <title>Nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2361007414</link>
         <description><![CDATA[<div>The Fibonacci sequence is <strong>a set of integers that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-28 18:30:01 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2361007414</guid>
      </item>
      <item>
         <title>Nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2361008115</link>
         <description><![CDATA[<div>I would describe a recursive sequence as a sequence in which terms are defined using one or more previous terms that are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-28 18:30:45 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2361008115</guid>
      </item>
      <item>
         <title>Justin</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2363572375</link>
         <description><![CDATA[<div>The Fibonacci sequence is <strong>a set of integers that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:02:49 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2363572375</guid>
      </item>
      <item>
         <title>Kiara </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2363586856</link>
         <description><![CDATA[<div>A recursive sequence is a sequence in which terms are defined using one or more previous terms which are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:11:27 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2363586856</guid>
      </item>
      <item>
         <title>Kiara </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2363587763</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:12:00 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2363587763</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368731515</link>
         <description><![CDATA[<div>A sequence can be represented with arithmetic sequences <strong>3, 9, 15, 21, 27</strong>, geometric sequences <strong>2, 6, 18, 54,</strong> and Fibonacci sequences&nbsp; <strong>0, 1, 1, 2, 3, 5</strong>.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:03:26 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368731515</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368731826</link>
         <description><![CDATA[<div>An arithmetic sequence has a constant difference between each consecutive pair of terms. A geometric sequence has a constant ratio between each pair of consecutive terms.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:03:36 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368731826</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368732071</link>
         <description><![CDATA[<div>I would describe a recursive sequence as a sequence in which terms are defined using one or more previous terms that are given.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:03:46 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368732071</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368732420</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:03:59 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2368732420</guid>
      </item>
      <item>
         <title>Kimora </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2375752106</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-08 21:58:34 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2375752106</guid>
      </item>
      <item>
         <title>Kimora</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2375752337</link>
         <description><![CDATA[<div>I would describe the recursive definition of a sequence as a pattern of terms that keeps going by the term.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-08 21:58:51 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2375752337</guid>
      </item>
      <item>
         <title>Zavier</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2383589217</link>
         <description><![CDATA[<div>The Fibonacci sequence is <strong>a set of integers that starts with a zero, followed by a one, then by another one, and then by a series of steadily increasing numbers</strong>.</div><div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-14 20:16:34 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2383589217</guid>
      </item>
      <item>
         <title>mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2398269638</link>
         <description><![CDATA[<div>The definition of a recursive sequence helps you determine if a sequence is arithmetic, geometric or neither because it tells you previous term and the rule/pattern.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-25 21:30:24 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2398269638</guid>
      </item>
      <item>
         <title>mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2398270351</link>
         <description><![CDATA[<div>A recursive sequence is <strong>a sequence in which terms are defined using one or more previous terms which are given</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-25 21:32:20 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2398270351</guid>
      </item>
      <item>
         <title>mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2398270481</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors omit the initial terms and start the sequence from 1 and 1 or from 1 and 2.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-25 21:32:49 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/41w1ufbu23fihbd3/wish/2398270481</guid>
      </item>
   </channel>
</rss>
