Some analogs of the identity F2<inf>n</inf> + F2<inf>n+1</inf> = F<inf>2n+1</inf>

Melham, RS

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Melham, RS	en_US
dc.date.issued	1999-11-01	en_US
dc.identifier.citation	Fibonacci Quarterly, 1999, 37 (4), pp. 305 - 311	en_US
dc.identifier.issn	0015-0517	en_US
dc.identifier.uri	http://hdl.handle.net/10453/17902
dc.relation.ispartof	Fibonacci Quarterly	en_US
dc.subject.classification	General Mathematics	en_US
dc.title	Some analogs of the identity F<sup>2</sup><inf>n</inf> + F<sup>2</sup><inf>n+1</inf> = F<inf>2n+1</inf>	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	37	en_US
utslib.for	0101 Pure Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0199 Other Mathematical Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
utslib.copyright.status	open_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	37	en_US

Please use this identifier to cite or link to this item:

Some analogs of the identity F<sup>2</sup><inf>n</inf> + F<sup>2</sup><inf>n+1</inf> = F<inf>2n+1</inf>