Results 61 to 70 of about 524,181 (126)

Stieltjes constants of L-functions in the extended Selberg class. [PDF]

open access: yesRamanujan J, 2021
Inoue S, Eddin SS, Suriajaya AI.
europepmc   +1 more source

Padovan numbers which are palindromic concatenations of two distinct repdigits. [PDF]

open access: yesRev R Acad Cienc Exactas Fis Nat A Mat, 2021
Chalebgwa TP, Ddamulira M.
europepmc   +1 more source

Bio-Inspired Network for Diagnosing Liver Steatosis in Ultrasound Images. [PDF]

open access: yesBioengineering (Basel), 2023
Yao Y, Zhang Z, Peng B, Tang J.
europepmc   +1 more source

The formula for survival in resuscitation

open access: yes, 2013
: The International Liaison Committee on Resuscitation (ILCOR) Advisory Statement on Education and Resuscitation in 2003 included a hypothetical formula - 'the formula for survival' (FfS) - whereby three interactive factors, guideline quality (science ...
Soreide, Eldar   +4 more
core  

Exploring Generalized $2^k$-Fibonacci Sequence: A New Family of the Fibonacci Sequence

open access: yesCommunications in Advanced Mathematical Sciences
The focus of this paper is to study the $2^k$–Fibonacci sequence, which is defined for all integers $2^k$, and its connections with both the Fibonacci and the Fibonacci-Lucas sequences.
Elis Gardel Costa Mesquista   +2 more
doaj   +1 more source

Tricomplex Fibonacci Numbers: A New Family of Fibonacci-Type Sequences

open access: yesMathematics
In this paper, we define a novel family of arithmetic sequences associated with the Fibonacci numbers. Consider the ordinary Fibonacci sequence {fn}n∈N0 having initial terms f0=0, and f1=1 and recurrence relation fn=fn−1+fn−2(n≥2).
Eudes A. Costa   +4 more
doaj   +1 more source

Plenary Abstracts Session & Oral Presentations

open access: yes
HemaSphere, Volume 10, Issue S1, June 2026.
wiley   +1 more source

A New Generalization of Leonardo Sequences: Biperiodic Leonardo Sequence

open access: yesJournal of Mathematics
In this study, we define a new type of number sequence called biperiodic Leonardo sequence by the recurrence relation Lena,b=aLen−1+Len−2+1 (for even n) and Lena,b=bLen−1+Len−2+1 (for odd n) with the initial conditions Le0a,b=Le1a,b=1.
Hasan Gökbaş
doaj   +1 more source

Home - About - Disclaimer - Privacy