<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Popcorn Discussions Week Ending 11/04/22 by Felix Mariano</title>
      <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv</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-30 17:22:59 UTC</pubDate>
      <lastBuildDate>2022-12-15 03:29:24 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet.net/icons/png/1f9d4.png</url>
      </image>
      <item>
         <title>Franky</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363600294</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. also it looks like a weird wave.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:19:08 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363600294</guid>
      </item>
      <item>
         <title></title>
         <author>eoliverogenao</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363602418</link>
         <description><![CDATA[<div>&nbsp;Start from zero and begin to put number 1 by 1 and then increasing, Besides need equal adding the number. </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:20:26 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363602418</guid>
      </item>
      <item>
         <title>Tiona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363603270</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding ones.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:20:56 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363603270</guid>
      </item>
      <item>
         <title>Jennifer bravo</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363603555</link>
         <description><![CDATA[<div>The Fibonacci sequence is a sequence of numbers in which each successive number in the sequence is obtained by adding the two previous numbers in the sequence.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:21:05 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363603555</guid>
      </item>
      <item>
         <title>Justin</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363604370</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. also it looks like a weird wave.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:21:33 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363604370</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363605035</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. also it looks like a weird wave.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:21:57 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363605035</guid>
      </item>
      <item>
         <title>sharniece</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363605387</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. also it looks like a weird wave.</div><div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:22:08 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363605387</guid>
      </item>
      <item>
         <title>cipriano</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363606820</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. also it looks like a weird wave.</div><div><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:22:58 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363606820</guid>
      </item>
      <item>
         <title>Keyona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363608253</link>
         <description><![CDATA[<div>Sequence of numbers where each successive number in the sequence is obtained by adding the 2 previous numbers in the sequence</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:23:51 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363608253</guid>
      </item>
      <item>
         <title>Leslie</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363608932</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. also it looks like a weird wave.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:24:15 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363608932</guid>
      </item>
      <item>
         <title>Maya</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363614404</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which each number is the sum of the two preceding number</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:27:21 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363614404</guid>
      </item>
      <item>
         <title>Rueucirs </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363617615</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. also it looks like a weird wave.</div><div><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:29:23 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363617615</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363621209</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. also it looks like a weird wave.</div><div>section</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:31:31 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363621209</guid>
      </item>
      <item>
         <title></title>
         <author>jhilliard21</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363623340</link>
         <description><![CDATA[<div>Sequence of numbers where each successive number in the sequence is obtained by adding the 2 previous numbers in the sequence</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-10-31 16:32:52 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2363623340</guid>
      </item>
      <item>
         <title>Allison</title>
         <author>avasquez248</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2364896333</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. also it looks like a weird wave.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-01 13:16:59 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2364896333</guid>
      </item>
      <item>
         <title>James </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365188675</link>
         <description><![CDATA[<div>recursively, by graph, or a table</div>]]></description>
         <enclosure url="https://mathbitsnotebook.com/Algebra1/Functions/seqfuncgraph1.gif" />
         <pubDate>2022-11-01 16:05:50 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365188675</guid>
      </item>
      <item>
         <title></title>
         <author>eoliverogenao</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365190701</link>
         <description><![CDATA[<div>Graph and recursively&nbsp;<br><br>The number on the top are the number sequences of arithmetic </div>]]></description>
         <enclosure url="https://d1avenlh0i1xmr.cloudfront.net/large/c173e31c-48bf-434c-a335-b2623475594d/58.jpg" />
         <pubDate>2022-11-01 16:07:01 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365190701</guid>
      </item>
      <item>
         <title>Rueucris</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365192024</link>
         <description><![CDATA[<div>F(1)47, F(2)40, F(3)50, F(4)55, F(5)68<br>Table,graph,Recurively&nbsp;<br><br><br></div>]]></description>
         <enclosure url="https://www.earthslab.com/wp-content/uploads/2019/01/OverlayBarGraphsExample_01.png" />
         <pubDate>2022-11-01 16:07:40 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365192024</guid>
      </item>
      <item>
         <title>Leslie</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365192890</link>
         <description><![CDATA[<div>A list, a graph, a table, recursively, etc... represent a sequence. </div>]]></description>
         <enclosure url="https://usercontent1.hubstatic.com/6296824_f520.jpg" />
         <pubDate>2022-11-01 16:08:10 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365192890</guid>
      </item>
      <item>
         <title></title>
         <author>jhilliard21</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365193019</link>
         <description><![CDATA[<div>Table,graph, and Recurively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-01 16:08:15 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365193019</guid>
      </item>
      <item>
         <title>Fabian</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365196260</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-01 16:10:10 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365196260</guid>
      </item>
      <item>
         <title>cipriano</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365203004</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-01 16:13:53 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2365203004</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366834298</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 14:58:45 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366834298</guid>
      </item>
      <item>
         <title>Justin</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366970641</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:13:04 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366970641</guid>
      </item>
      <item>
         <title>keyona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366971309</link>
         <description><![CDATA[<div>table graph and recursively </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:13:28 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366971309</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366971511</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-11-02 16:13:35 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366971511</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366972730</link>
         <description><![CDATA[<div>Table, Graph and Recursively.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:14:19 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366972730</guid>
      </item>
      <item>
         <title>Laniya Peters</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366974169</link>
         <description><![CDATA[<div>A table, a graph and recursively.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:15:13 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366974169</guid>
      </item>
      <item>
         <title>keyona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366975421</link>
         <description><![CDATA[<div>The nth term of a geometric sequence with first term a and the common ratio r is given by <strong>an=arn−1</strong> a n = a r n − 1 <br><br>if the nth term is <strong>3n + 2, the tenth term can be found by n=10.  </strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:15:50 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366975421</guid>
      </item>
      <item>
         <title>Tiona</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366975831</link>
         <description><![CDATA[<div>Table, Graph and Recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:16:06 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366975831</guid>
      </item>
      <item>
         <title></title>
         <author>eoliverogenao</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366980105</link>
         <description><![CDATA[<div>An=arn -1 a n= a r n - 1 </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:18:40 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2366980105</guid>
      </item>
      <item>
         <title>Amanda </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2367003952</link>
         <description><![CDATA[<div>The Fibonacci sequence, in which<br>each number is the sum of the two<br>preceding ones. The sequence<br>commonly starts from 0 and 1,<br>although some authors omit the<br>initial terms and start the<br>sequence from 1 and 1 or from 1<br>and 2. also it looks like a weird<br>wave</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:32:37 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2367003952</guid>
      </item>
      <item>
         <title>Rueucris</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2367004768</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:33:06 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2367004768</guid>
      </item>
      <item>
         <title>sharniece</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2367042620</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-02 16:54:41 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2367042620</guid>
      </item>
      <item>
         <title>samia</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368602196</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 14:51:17 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368602196</guid>
      </item>
      <item>
         <title>Allison </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368735169</link>
         <description><![CDATA[<div>Table, graph and recursively </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:05:40 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368735169</guid>
      </item>
      <item>
         <title>Allison </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368736561</link>
         <description><![CDATA[<div>3n + 2, the tenth term can be found by n=10.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:06:30 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368736561</guid>
      </item>
      <item>
         <title>maya</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368736715</link>
         <description><![CDATA[<div>an+a1.rn-1</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:06:32 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368736715</guid>
      </item>
      <item>
         <title>Fabian</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368740819</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:08:51 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368740819</guid>
      </item>
      <item>
         <title>Leslie</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368770726</link>
         <description><![CDATA[<div>&nbsp;<strong>an=a1⋅rn−1</strong>&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-03 16:26:58 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2368770726</guid>
      </item>
      <item>
         <title>Laniya Peters</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370007057</link>
         <description><![CDATA[<div>It is a series of numbers in which each number is the amount of the two preceeding numbers.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-04 12:26:50 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370007057</guid>
      </item>
      <item>
         <title>Laniya Peters</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370008901</link>
         <description><![CDATA[<div><strong>Sn=a1(1−rn)1−r</strong>.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-04 12:28:12 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370008901</guid>
      </item>
      <item>
         <title>Kiara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370576119</link>
         <description><![CDATA[<div>&nbsp;Start from zero and begin to put number 1 by 1 and then increasing, Besides need equal adding the number.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-04 19:13:34 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370576119</guid>
      </item>
      <item>
         <title>Kiara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370576348</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-04 19:13:53 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370576348</guid>
      </item>
      <item>
         <title>Kiara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370576534</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-04 19:14:08 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370576534</guid>
      </item>
      <item>
         <title></title>
         <author>rmald27</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370645258</link>
         <description><![CDATA[<div>3n + 2 is the tenth term that can be found by n=10.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-04 20:42:57 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2370645258</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2373507550</link>
         <description><![CDATA[<div>&nbsp;Start from zero and begin to put number 1 by 1 and then increasing, Besides need equal adding the number.</div><div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-07 17:18:14 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2373507550</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2373508004</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-07 17:18:31 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2373508004</guid>
      </item>
      <item>
         <title>Darina</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2373508620</link>
         <description><![CDATA[<div>3n + 2 is the tenth term that can be found by n=10.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-07 17:18:51 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2373508620</guid>
      </item>
      <item>
         <title>Kimora</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2375750544</link>
         <description><![CDATA[<div>Start from zero and begin to put number 1 by 1 and then increasing, Besides need equal adding the number.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-08 21:56:34 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2375750544</guid>
      </item>
      <item>
         <title>Kimora </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2375750757</link>
         <description><![CDATA[<div>Table, graph and recursively. </div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-08 21:56:50 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2375750757</guid>
      </item>
      <item>
         <title>Kimora </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2375751589</link>
         <description><![CDATA[<div>The nth term of a geometric sequence with first term a and the common ratio r is given by <strong>an=arn−1</strong> a n = a r n − 1 <br><br>if the nth term is <strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-08 21:57:53 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2375751589</guid>
      </item>
      <item>
         <title>Nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2380818628</link>
         <description><![CDATA[<div>It is a series of numbers in which each number is the amount of the two preceeding numbers.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-12 04:50:05 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2380818628</guid>
      </item>
      <item>
         <title>Nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2380818711</link>
         <description><![CDATA[<div>Table, graph and recursively.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-12 04:50:19 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2380818711</guid>
      </item>
      <item>
         <title>Nyeara</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2380818806</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-12 04:50:38 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2380818806</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383295368</link>
         <description><![CDATA[<div>Table, graph and recursively</div><div>section</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-14 17:13:06 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383295368</guid>
      </item>
      <item>
         <title>AnthonyL</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383296559</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-14 17:13:49 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383296559</guid>
      </item>
      <item>
         <title>Zavier</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383590205</link>
         <description><![CDATA[<div>Sequence of numbers where each successive number in the sequence is obtained by adding the 2 previous numbers in the sequence</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-14 20:17:18 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383590205</guid>
      </item>
      <item>
         <title>Zavier</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383591765</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-14 20:18:36 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383591765</guid>
      </item>
      <item>
         <title>Zavier</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383592381</link>
         <description><![CDATA[<div><strong>an=a1⋅rn−1</strong>&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-14 20:19:04 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2383592381</guid>
      </item>
      <item>
         <title>mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2398270780</link>
         <description><![CDATA[<div>The Fibonacci sequence is a sequence of numbers in which each successive number in the sequence is obtained by adding the two previous numbers in the sequence.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-25 21:34:00 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2398270780</guid>
      </item>
      <item>
         <title>mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2398270876</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-25 21:34:24 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2398270876</guid>
      </item>
      <item>
         <title>Mariam</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2398271048</link>
         <description><![CDATA[<div><strong>3n + 2, the tenth term can be found by n=10.</strong></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-25 21:35:00 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2398271048</guid>
      </item>
      <item>
         <title>Tiona </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2402662439</link>
         <description><![CDATA[<div>3n + 2, the nth term can be found by n=10</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-29 22:43:49 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2402662439</guid>
      </item>
      <item>
         <title></title>
         <author>jhilliard21</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2403648792</link>
         <description><![CDATA[<div>The Fibonacci sequence is a sequence of numbers in which each successive number in the sequence is obtained by adding the two previous numbers in the sequence.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-30 14:38:22 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2403648792</guid>
      </item>
      <item>
         <title></title>
         <author>jhilliard21</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2403649101</link>
         <description><![CDATA[<div>Table, graph and recursively</div><div><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-30 14:38:32 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2403649101</guid>
      </item>
      <item>
         <title></title>
         <author>jhilliard21</author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2403649819</link>
         <description><![CDATA[<div>3n + 2, the nth term can be found by n=10</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-11-30 14:38:56 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2403649819</guid>
      </item>
      <item>
         <title>chris r </title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2421366530</link>
         <description><![CDATA[<div>The Fibonacci sequence is a sequence of numbers in which each successive number in the sequence is obtained by adding the two previous numbers in the sequence.&nbsp;</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-12-15 03:28:49 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2421366530</guid>
      </item>
      <item>
         <title>chris r</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2421366743</link>
         <description><![CDATA[<div>Table, graph and recursively</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-12-15 03:29:09 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2421366743</guid>
      </item>
      <item>
         <title>chris r</title>
         <author></author>
         <link>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2421367046</link>
         <description><![CDATA[<div>3n + 2, the nth term can be found by n=10</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-12-15 03:29:24 UTC</pubDate>
         <guid>https://padlet.com/felixmariano2/vxdsjb0jmuqx55gv/wish/2421367046</guid>
      </item>
   </channel>
</rss>
