Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066671 Powers of 2 arising in A066669: a(n) is the largest even divisor of EulerPhi[A066669(n)], which is by definition is a power of 2. +0
2
2, 2, 2, 4, 2, 2, 4, 2, 2, 4, 4, 4, 4, 4, 8, 4, 8, 8, 4, 4, 8, 2, 2, 4, 8, 4, 8, 8, 4, 2, 16, 4, 4, 8, 8, 8, 8, 8, 2, 8, 8, 8, 8, 8, 4, 2, 32, 8, 16, 16, 4, 2, 8, 16, 16, 8, 8, 2, 32, 16, 16, 8, 8, 4, 16, 4, 16, 16, 4, 8, 32, 16, 8, 16, 16, 2, 2, 16, 4, 8, 16, 4, 8, 2, 16, 8, 32, 4, 64, 32, 32 (list; graph; listen)
OFFSET

1,1

EXAMPLE

First, 4th and 15th terms in A066669 are 7, 13, 35; Phi[7] = 2.3, Phi[13] = 4.3, Phi[35] = 24 = 8.3; the largest even divisors[powers of 2] are 2, 4, 8; so a(1) = 2, a(4) = 4, a(15) = 8.

CROSSREFS

Cf. A000010, A066669-A066673, A065966.

Adjacent sequences: A066668 A066669 A066670 this_sequence A066672 A066673 A066674

Sequence in context: A102445 A027389 A049716 this_sequence A049627 A134058 A086973

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 18 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research