login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A335741
Number of Pell numbers (A000129) <= n.
2
1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
OFFSET
0,2
COMMENTS
The sequence is constant on the interval A000129(k) < n <= A000129(k+1).
LINKS
Dorin Andrica, Ovidiu Bagdasar, and George Cătălin Tųrcąs, On some new results for the generalised Lucas sequences, An. Şt. Univ. Ovidius Constanţa (Romania, 2021) Vol. 29, No. 1, 17-36.
FORMULA
a(n) = 1+floor(log_alpha(2*sqrt(2)*n+1)), n>=0, where alpha=1+sqrt(2).
EXAMPLE
The Pell numbers A000129 are 0,1,2,5,12,29,70,...
We have a(2)=a(3)=a(4)=3, since there are three Pell numbers less than or equal to 2,3 and 4, respectively.
MATHEMATICA
Block[{a = 2, b = -1, nn = 105, u, v = {}}, u = {0, 1}; Do[AppendTo[u, Total[{-b, a} u[[-2 ;; -1]]]]; AppendTo[v, Count[u, _?(# <= i &)]], {i, nn}]; {Boole[First[u] <= 0]}~Join~v] (* Michael De Vlieger, Jun 11 2021 *)
Module[{pn=LinearRecurrence[{2, 1}, {0, 1}, 9], nn=100}, Accumulate[Table[If[ MemberQ[ pn, n], 1, 0], {n, 0, nn}]]] (* Harvey P. Dale, Apr 10 2022 *)
CROSSREFS
Cf. A000129 (Pell Numbers), A108852 (Fibonacci), A130245 (Lucas), A130253 (Jacobsthal).
Partial sums of A105349.
Sequence in context: A356593 A081288 A130256 * A103586 A194847 A262070
KEYWORD
nonn
AUTHOR
Ovidiu Bagdasar, Jun 20 2020
STATUS
approved