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!)
A072866 Smallest k > 1 dividing tau(k*2^n) (cf. A000005). 1
2, 4, 2, 10, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 12, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 7, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 5, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 12, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 10, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 12, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 11, 2, 3, 2, 6, 2, 4, 2, 3, 2, 4, 2, 5, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Sequence contains the values 2,3,4,5,6,7,10,11,12 only. Is there any pattern ? a(m) = 4 for m =1,9,13,21,25,33,37,45,49,...This subsequence has the recurrence b(1)=1, b(2k)=b(2k-1)+8, b(2k+1)=b(2k)+4. If a(m) = 10 then m == 0 (mod 3). If m>n, a(n)=10, a(m)=10 then m-n == 0 (mod 60).
LINKS
PROG
(PARI) A072866(n) = { n = (1<<n); for(k=2, oo, if(!(numdiv(k*n)%k), return(k))); }; \\ Antti Karttunen, Feb 06 2019
CROSSREFS
Cf. A000005.
Sequence in context: A188813 A324958 A353108 * A061393 A260361 A055935
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Jul 27 2002
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 March 29 08:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)