Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097214
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097214 Numbers n such that A076078(n) = n, where A076078(n) equals the number of sets of distinct positive integers with a least common multiple of n. +0
3
1, 2, 4, 8, 10, 16, 32, 44, 64, 128, 184, 256, 512, 752, 1024, 2048, 4096, 8192, 12224, 16384, 32768, 49024, 61064, 65536, 131072, 262124, 524288, 981520, 1048576, 2097152, 4194304, 8388608, 12580864, 16777216, 33554432, 67108864, 134217728 (list; graph; listen)
OFFSET

1,2

COMMENT

Contains all powers of 2 (A000079). Union of A000079 and A097215.

If 3*2^n-1 is prime then 2^n*(3*2^n-1) is in the sequence. So 2^A002235*(3*2^A002235-1) is a subsequence of this sequence. - Farideh Firoozbakht (mymontain(AT)yahoo.com), Aug 06 2005

EXAMPLE

A total of 10 sets of distinct positive integers have a least common multiple of 10: 1,2,5; 1,2,5,10; 1,2,10; 1,5,10; 1,10; 2,5; 2,5,10; 2,10; 5,10; and 10. Hence 10 is in the sequence.

CROSSREFS

Cf. A097215

Cf. A002235.

Sequence in context: A045795 A083655 A097210 this_sequence A045579 A066363 A122636

Adjacent sequences: A097211 A097212 A097213 this_sequence A097215 A097216 A097217

KEYWORD

nonn

AUTHOR

Matthew Vandermast (ghodges14(AT)comcast.net), Aug 12 2004

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research