login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185615 Numbers n such that n divides A000201(n)^m for some integer m>0, where A000201 is the lower Wythoff sequence 3
1, 4, 8, 25, 50, 108, 169, 243, 256, 338, 486, 512, 729, 768, 972, 1024, 1156, 1215, 2312, 3375, 5000, 7921, 8192, 8748, 10000, 12800, 15000, 15842, 20000, 25000, 50176, 54289, 85184, 88209, 100352, 104976, 108578, 131072, 176418, 177147 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Let n = p_1^{e_1}*p_2^{e_2}*...*p_r^{e_r}. Then, n is in this sequence iff p_1*p_2*...*p_r divides A000201(n).

Many of these terms are powers of fibonacci numbers.

Perhaps this is expected, since A000201 involves floor(n*phi).

LINKS

Table of n, a(n) for n=1..40.

EXAMPLE

For n=8, A000201(8)=12. Since 8 divides 12^2, 8 is in this sequence.

For n=9, A000201(9)=14. Since 9 cannot divide 14^m for any m, 9 is not in this sequence.

CROSSREFS

Cf. A000201, A185616, A185617.

Sequence in context: A131637 A163143 A154586 * A068367 A000964 A107840

Adjacent sequences:  A185612 A185613 A185614 * A185616 A185617 A185618

KEYWORD

nonn

AUTHOR

Paul D. Hanna and Sean A. Irvine, Jan 31 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 08:53 EST 2016. Contains 278775 sequences.