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.

A091926 Least k<=n such that A002487(k)=A002487(n).

This page as a plain text file.
%I A091926 #16 Nov 14 2017 16:50:24
%S A091926 1,1,3,1,5,3,5,1,9,5,11,3,11,5,9,1,11,9,19,5,21,11,19,3,19,11,21,5,19,
%T A091926 9,11,1,33,11,35,9,37,19,39,5,37,21,43,11,45,19,35,3,35,19,45,11,43,
%U A091926 21,37,5,39,19,37,9,35,11,33,1,19,33,37,11,69,35,43,9,73,37,75,19,77,39,43,5
%N A091926 Least k<=n such that A002487(k)=A002487(n).
%C A091926 a(n)=n for n=1,3,5,9,11,19,21,33,....
%H A091926 Rémy Sigrist, <a href="/A091926/b091926.txt">Table of n, a(n) for n = 1..16384</a>
%H A091926 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a>
%o A091926 (PARI) fusc(n)=local(a=1,b=0);while(n>0,if(bitand(n,1),b+=a,a+=b);n>>=1);b \\ after _Charles R Greathouse IV_ at A002487
%o A091926 a(n) = v = fusc(n); k = 0; while(fusc(k) != v, k++); k; \\ _Michel Marcus_, Dec 06 2013
%Y A091926 Cf. A091945.
%K A091926 nonn,look
%O A091926 1,3
%A A091926 _Benoit Cloitre_, Mar 11 2004