login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091926 Least k<=n such that A002487(k)=A002487(n). 3
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, 9, 11, 1, 33, 11, 35, 9, 37, 19, 39, 5, 37, 21, 43, 11, 45, 19, 35, 3, 35, 19, 45, 11, 43, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
a(n)=n for n=1,3,5,9,11,19,21,33,....
LINKS
PROG
(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
a(n) = v = fusc(n); k = 0; while(fusc(k) != v, k++); k; \\ Michel Marcus, Dec 06 2013
CROSSREFS
Cf. A091945.
Sequence in context: A076363 A143865 A071168 * A325685 A109606 A318727
KEYWORD
nonn,look
AUTHOR
Benoit Cloitre, Mar 11 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)