On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)

Gespeichert in:
Bibliographische Detailangaben
Datum:2016
Hauptverfasser: D. Şimşek, F. Abdullayev
Format: Artikel
Sprache:English
Veröffentlicht: 2016
Schriftenreihe:Ukrainian Mathematical Bulletin
Online Zugang:http://jnas.nbuv.gov.ua/article/UJRN-0000743713
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Library portal of National Academy of Sciences of Ukraine | LibNAS

Institution

Library portal of National Academy of Sciences of Ukraine | LibNAS
id open-sciencenbuvgovua-52833
record_format dspace
spelling open-sciencenbuvgovua-528332024-02-29T13:08:31Z On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0) D. Şimşek F. Abdullayev 1810-3200 2016 en Ukrainian Mathematical Bulletin http://jnas.nbuv.gov.ua/article/UJRN-0000743713 Article
institution Library portal of National Academy of Sciences of Ukraine | LibNAS
collection Open-Science
language English
series Ukrainian Mathematical Bulletin
spellingShingle Ukrainian Mathematical Bulletin
D. Şimşek
F. Abdullayev
On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
format Article
author D. Şimşek
F. Abdullayev
author_facet D. Şimşek
F. Abdullayev
author_sort D. Şimşek
title On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
title_short On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
title_full On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
title_fullStr On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
title_full_unstemmed On the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
title_sort on the recursive sequence x_(n+1)=(x_(n-(4k+3)))(1+_(t=0)
publishDate 2016
url http://jnas.nbuv.gov.ua/article/UJRN-0000743713
work_keys_str_mv AT dsimsek ontherecursivesequencexn1xn4k31t0
AT fabdullayev ontherecursivesequencexn1xn4k31t0
first_indexed 2025-07-17T23:12:51Z
last_indexed 2025-07-17T23:12:51Z
_version_ 1850416767708430336