|
Search: id:A055600
|
|
|
| A055600 |
|
Numbers of form 2^i*3^j+1 with i, j >= 0. |
|
+0
13
|
|
| 2, 3, 4, 5, 7, 9, 10, 13, 17, 19, 25, 28, 33, 37, 49, 55, 65, 73, 82, 97, 109, 129, 145, 163, 193, 217, 244, 257, 289, 325, 385, 433, 487, 513, 577, 649, 730, 769, 865, 973, 1025, 1153, 1297, 1459, 1537, 1729, 1945, 2049, 2188, 2305, 2593, 2917, 3073, 3457, 3889
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
If X is an n-set and Y a fixed (n-5)-subset of X then a(n-5) is equal to the number of 2-subsets of X intersecting Y. - Milan R. Janjic (agnus(AT)blic.net), Aug 15 2007
|
|
REFERENCES
|
G. Everest, P. Rogers and T. Ward, A higher-rank Mersenne problem, pp. 95-107 of ANTS 2002, Lect. Notes Computer Sci. 2369 (2002).
|
|
LINKS
|
Milan Janjic, Two Enumerative Functions
|
|
FORMULA
|
a(n)=A003586(n)+1
|
|
EXAMPLE
|
a(7)=13 since 13=2^2*3^1+1
|
|
CROSSREFS
|
Primes in this sequence give A005109 (Class 1- or Pierpoint primes).
Adjacent sequences: A055597 A055598 A055599 this_sequence A055601 A055602 A055603
Sequence in context: A032955 A060526 A036408 this_sequence A139528 A117290 A045782
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jun 01 2000
|
|
|
Search completed in 0.002 seconds
|
