<?xml version="1.0" encoding="UTF-8"?>
<records>
<record>
<language>eng</language>
<publisher>Science and Education Publishing</publisher>
<journalTitle>Turkish Journal of Analysis and Number Theory</journalTitle>
<eissn>ISSN Pending</eissn>
<publicationDate>2014-02-07</publicationDate>
<volume>2</volume>
<issue>1</issue>
<startPage>6</startPage>
<endPage>8</endPage>
<doi>10.12691/tjant-2-1-2</doi>
<publisherRecordId>TJANT2014212</publisherRecordId>
<documentType>article</documentType>
<title language="eng">Certain Properties of Generalized Fibonacci Sequence</title>
<authors>
<author>
<name>Yashwant K. Panwar</name>
<email>yashwantpanwar@gmail.com</email>
<affiliationId>1</affiliationId>
</author>
<author>
<name>Mamta Singh</name>
<affiliationId>2</affiliationId>
</author>

</authors>
<affiliationsList>
<affiliationName affiliationId="1">Department of Mathematics and MCA, Mandsaur Institute of Technology, Mandsaur (M. P.), India</affiliationName>
<affiliationName affiliationId="2">Department of Mathematical Sciences and Computer Application, Bundelkhand University, Jhansi (U. P.), India</affiliationName>
</affiliationsList>
<abstract language="eng">In this study, we present certain properties of Generalized Fibonacci sequence. Generalized Fibonacci sequence is defined by recurrence relation . This was introduced by Gupta, Panwar and Sikhwal. We shall use the Induction method and Binet's formula and give several interesting identities involving them.</abstract>
<fullTextUrl format="pdf">http://pubs.sciepub.com/tjant/2/1/2/tjant-2-1-2.pdf</fullTextUrl>
<keywords language="eng">generalized Fibonacci sequenceBinet's formula</keywords>
</record>
</records>
