cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A035340 6th column of Wythoff array.

This page as a plain text file.
%I A035340 #27 Mar 24 2025 06:01:27
%S A035340 13,47,68,102,136,157,191,212,246,280,301,335,369,390,424,445,479,513,
%T A035340 534,568,589,623,657,678,712,746,767,801,822,856,890,911,945,979,1000,
%U A035340 1034,1055,1089,1123,1144,1178,1199,1233,1267,1288,1322,1356,1377,1411,1432
%N A035340 6th column of Wythoff array.
%C A035340 The asymptotic density of this sequence is 1/phi^7 = A094214^7 = 0.03444185... . - _Amiram Eldar_, Mar 24 2025
%H A035340 Seiichi Manyama, <a href="/A035340/b035340.txt">Table of n, a(n) for n = 0..10000</a>
%H A035340 John H. Conway and N. J. A. Sloane, <a href="/A019586/a019586.pdf">Notes on the Para-Fibonacci and related sequences</a>.
%H A035340 N. J. A. Sloane, <a href="/classic.html#WYTH">Classic Sequences</a>.
%p A035340 t:= (1+sqrt(5))/2: [ seq(13*floor((n+1)*t)+8*n,n=0..80) ];
%t A035340 a[n_] := 13 * Floor[n * GoldenRatio] + 8*(n-1); Array[a, 100] (* _Amiram Eldar_, Mar 24 2025 *)
%Y A035340 Column k of A035513: A003622 (k=1), A035336 (k=2), A035337 (k=3), A035338 (k=4), A035339 (k=5), this sequence (k=6).
%Y A035340 Cf. A094214.
%K A035340 nonn
%O A035340 0,1
%A A035340 _N. J. A. Sloane_ and _J. H. Conway_