index     |     home
Fortean Mysteries SIG     recent history              issue 83    
Newsletter of the Fortean Mysteries SIG of American Mensa          
   Aprilis 1679 AC                                 only 200,000 millicents per 3 issues
Published irregularly since Undecember 1658 AC
 "All things are possible ..." (Mt 19:26)


    Four veterans' groups in Pleasanton, CA, sponsored a class on dowsing to study whether domestic terrorists could be identified by pointing sticks at suspicious people. One of the veterans' leaders (who believes that "the government" and oil and mining companies regularly use dowsing) said, "You can't wait for the FBI and police to come up with solutions when you have the bad guys living among us." Following the 9-11 attacks, some Pleasanton veterans also received training in remote viewing and are now reportedly bringing local families up to speed on their MIA relatives from past wars. [Tri-Valley Herald, 2003.3.25]
   Brian J. Samdahl, 41, of Bridgeview, IL, was charged with stabbing a stranger 15 times at a Wal-Mart. He told police he thought the problem was that his government-implanted computer chip was broken. [Daily Southtown, 2003.2.13]
    The new Kaiser Medical Center hospital in Fremont, CA, had a special ceremony performed by their chaplain, using symbols and inspirational words on rocks, to battle spirits believed responsible for beds moving and doors slamming on their own. [San Jose Mercury News, 2002.11.27]
   A ghost called "Barfing Barb" reportedly haunts a college dormitory at Indiana State University at Terre Haute. According to folklore professor Nan McEntire, Barfing Barb has been haunting Burford Hall for generations. Witnesses describe it as a female who spews paranormal vomitus all over the place. She is believed by many to be the restless spirit of a co-ed who died after one too many frat parties. (BIZARRE NEWS - 2003.4.16]
    The Atlanta firm Brighthouse Institute for Thought Sciences regularly runs consumers through MRIs while they look at pictures of products so that researchers can see which parts of the brain are stimulated in order to learn consumers' subconscious thoughts about those products. A Brighthouse spokesman tried to say as little as possible about this "neuromarketing" technology, and which companies pay the bills, and told the Canadian public radio program "Right now (our clients) would rather not be exposed. We have been kind of running under the radar with a lot of the breakthrough technology." (Canadian Broadcasting Corporation "Marketplace," 2002.12.3)
   When Diane Kurtz of New Hartford, CT, couldn't find her car keys, she prayed to the patron saint of lost articles, St. Anthony, to return them to her. Not only did she get the keys back that day, but also a 1 carat diamond wedding ring she had lost 15 years ago. It was found in the muck at the bottom of a wastewater drainage pool by a Hartford sewage treatment worker. The man who found it had to do some indepth detective work checking state public records to find the right Kurtz family. The family believes the ring accidentally fell down the sink in a bathroom. (BIZARRE NEWS - 2003.1.29)
    Contemporary Holy Shrines -- (1) A mud puddle in the shape of Buddha's footprint attracted pilgrims to Thailand's Pungna province but is said to be guarded by a frog whose skin is fondled by people searching for lottery numbers; (2) a potato in the shape of the Hindu god Ganesh, the elephant-headed god, attracted pilgrims to a private index in Bombay, India; (3) An outline in a dead tree trunk in the likeness of the Blessed Virgin Mary looking down at Baby Jesus, attracting pilgrims to the property of nonbeliever Bill Gaede in Fresno County, CA; (4) the condensation on a greenhouse wall in the image of the Blessed Virgin Mary attracted pilgrims to a private index in Ile-a-la-Crosse, Saskatchewan. [United Press International, 9-4-02]
    Darwin award winners -- A man fleeing police in a stolen car leaped from it as it headed for a wall, but tripped and was pinned under it and fatally run over [Los Angeles Times, 2002.4.25]  Terrance Claybrooks, 27, of Nashville, TN, with a lengthy record and running from police, hid inside a friend's ice-cream truck freezer, but suffocated on carbon dioxide fumes from the dry ice. [WKRN.com, 2002.6.19]  Edward McBride, 37, of Tulsa, OK, fled police after a burglary, but drowned in the Arkansas River, weighted down with about 50 pounds of stolen cameras. [Associated Press, 2002.8.17]
   Cultists -- Scott Caruthers, 57, was arrested in Carroll County, MD, for conspiracy to murder the ex-husbands of two of his alleged disciples; according to a Baltimore Sun report, Caruthers has claimed to be an alien who reported back to the mother ship by messages to cats. [Baltimore Sun, 2002.9.8]  Dem Mam, 54, head of a fringe Buddhist cult, was freed from custody in October, having been determined not responsible for three disciples' immolating themselves in a bathtub of gasoline in a Cambodian countrysidepagoda; Dem Mam teaches that ritual suicide is the only path to heaven but told police that he did not need to commit suicide himself because he is already holy enough. [Reuters, 2002.10.1,10]
    In a state of sheer terror, an English woman was trapped inside her own index for 24 hours as a dark, shadowy figure lingered outside her front door. Fearing that the sinister creature was the Beast of Bodmin, a huge, black mythical creature, probably of the cat family, having the usual refinements of burning eyes and fiery breath, the woman remained a prisoner of fear. Eventually, she gathered up the courage to call the RSPCA, whose officers rushed to the scene to confront the snarling beast. They came to her rescue and were able to subdue the black plastic bag that was filled with a number of telephone directories that had kept the frightened woman tucked away in her index for an entire day. [BIZARRE NEWS -- 2003.1.10]

MORE SEQUENCES
*acci: [nonacci backformation] integer not nonacci -- 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39,
*agonal: [nonagonal backformation] integer not nonagonal  f(n) = N(n(7n - 5)/2) -- 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30,
*almost-perfect: A079718 digital expansion of perfect numbers -- 2, 1, 0, 1, 8, 2, 2, 9, 9, 0, 1, 2, 3, 4, 2, 4, 7, 9, 3, 1, 6,  0, 0, 3, 6, 2, 2, 8, 5, 0, 5, 6, 0, 8, 6, 8, 9, 6, 1, 8, 4, 8, 2, 7, 2,
alpha Centauri: [Clifford Pickford] bidigital expansion of (p -3),  -- 14, 15, 92, 65, 35, 89, 79, 32, 38,
*basic: inventory of natural numbers in bases between number and one -- 1, 10, 11, 10, 11, 111, 10, 11, 100, 1111, 10, 11, 12, 101, 11111, 10, 11, 12, 20, 110, 111111, 10, 11,
*big: [biprime-indexed-good] 37, 121, 151, 157, 529, 631, 1633, 1969, 29041, 2047
*bipolar:  with only 0s and 9s -- 900, 909, 990, 9000, 9009, 9090, 9099, 9900, 9909, 9990, 90000,
Brown: [Kevin S. Brown] f(n) = n! + 1 = m2 -- 25, 121, 5041
busy beaver: [Rado] A060843 non-computable maximum number of steps before halting for Turing machine program with n states BB(n) N< 1, 6, 21, 107, 47176870,
*cancrine: A081365 word palindrome number -- 101, 202, 303, 404, 505, 606, 707, 808, 909, 1001,
*CATS: [cube-add-then-sort] A079320 f(n) = sort(n3 + n) -- 1, 3, 68, 13, 222, 35, 25, 378, 11, 1234, 147, 122, 2578, 339, 1124, 349, 558, 6788, 28, 2289, 167, 1129,
*cubefull: [square:squarefull::cube:?] A081367 referring to integer divisible by a prime cubed, f(n) = 0 (mod p3)-- 8, 16, 27, 32, 64, 81, 125, 128, 243, 256, 343, 375, 500, 512, 686, 729, 750, 889, 1000, 1024, 1029, 1125, 1250, 1331, 1372, 1375, 1458,
*decacci: Fibonacci-like sequence but adding previous 10 -- 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1023, 2045, 4088, 8172, 16336, 32656,
*double primorial: [factorial:primorial::double factorial:?] A07907 n## = p(i)p(i - 2)##; ((2n)## = P(p(2i)) and  (2n + 1)## = P(p(2i + 1)), where p(n) = nth prime -- 2, 3, 10, 21, 110, 273, 1870, 5187, 43010, 150423, 1333310, 5565651, 54665710, 239322993,
*fadias primes: [factorial differences-and-sums] f(n) = n! - (n + 1)! + (n + 2)! = p -- 5, 19, 101, 619, 4421, 35899, 326981, 3301819, 36614981, 442386619, 5784634181,
Horner*: [Jack Horner's pulling out of pi] A032445 number of digits to reach n in decimal expansion of pi -- 2, 7, 1, 3, 5, 8, 14, 12, 6, 50, 95, 149, 111, 3, 5, 40, 96, 426, 37, 54, 94, 137, 18, 293, 91, 8, 30, 26,
*icca: [prime:emirp::acci:?] 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29,
*left primorial: A079096 #n = S(P(p(i))-- 1, 3, 9, 39, 249, 2559, 5559, 516069, 10215759, 233308629,
*lil: [lucky-indexed-lucky] 1, 7, 11, 29, 199, 5778, 1149851
*lime: [sublime backformation] number such that (n - 1)! < e^(m - 1/2) < n! where m = sublime -- 4, 58
manille: referring to integer with 2 or 7 -- 2, 7, 22, 27, 72, 77, 222, 227,  272, 277, 722, 727, 772, 777,
*middling: referring to integer with only 4,  5 or 6 -- 4, 5, 6, 44, 55, 66, 444, 555, 666, 4444, 5555, 6666,
*middlinger: referring to integer with two of 4, 5 or 6 -- 45, 46, 54, 56, 64, 65, 445, 446, 454, 455, 464,
*middlingest: 456, 465, 546, 564, 645, 4654, 4456, 4465, 4546, 4564, 4645, 4654, 5456, 5465, 5546,
*more-or-less prime: A045718 f(2n) = p(n) - 1, f(2n - 1) = p(n) + 1 -- 1, 2, 3, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 28, 30, 32, 36, 38, 40, 42, 44, 46, 48, 52, 54, 58, 60, 62, 66, 68,
*mostly-harmless: without three-fourths of {a, h, m, r} -- 0, 4, 8, 14, 18, 24, 28, 40, 41, 42, 45, 46, 47,
*mostly prime: A081385 f(n) = [p/2 +  1/2] -- 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 16, 17, 18, 19, 20, 26, 27, 28, 29,
*mostly-useless: without two-thirds of {e, s, u} -- 0, 1, 3, 4, 6, 8, 9, 10, 11, 12, 13, 15, 18,
*nabrut: [turban ananym] with r, t, or u -- 0, 2, 3, 4, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19,
*neve: [prime:emirp::even:?] A079720 nonpalindromic even integer which is still even when reversed -- 24, 26, 28, 42,  46, 48, 62, 64, 68, 82, 84, 86,  204, 206, 208,  214, 216, 218, 224, 226, 228, 402, 404,
*nonacci: Fibonacci-like sequence but adding previous 9 -- 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 511, 1021, 2040, 4076, 8144, 16272, 32512, 64960, 129792,
St. John: [Jn 21:11] with substring "153" -- 153, 1520, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538,
*satyr: [sort-add-then-you-reverse] f(n) = R(sort(n) + n) -- 2, 4, 6, 8, 1, 21, 41, 61, 81, 11, 22, 42, 62, 82, 3, 23, 43, 63, 83, 4, 42, 44, 46,48, 5, 66, 77, 88, 99, 11, 112, 114, 116, 118,
*semi-Tribonacci: [Fibonacci:semi-Fibonacci::Tribonacci:?] A074364 f(0) = 0 -- 0, 1, 1, 2, 1, 4, 2, 7, 1, 10, 4, 15, 2, 21, 7, 30, 1, 38, 10, 49, 4, 63, 15, 82, 2, 99, 21, 122, 7, 150, 30, 187, 1, 218, 38, 257, 10, Starke: [E. Starke] aka X-Files numbers, f(n) = 1492n - 1770n - 1860n + 2141n -- 0, 206276, 1124101062, 41060260928896, 12565214785548390
sublime: A081357 number whose divisors are also perfect -- 12, 6086555670238378989670371734243- 169622657830773351885970528324860512791691264
*subminimal: [factorial:subfactorial::minmal:?] A079717 -- 0, 1, 1, 2, 4, 6, 9, 13, 18, 22, 24, 44, 53, 66, 71, 88, 132, 212, 265, 309, 331, 353, 377, 464, 477, 618, 927, 1059, 1130,
*subprimorial: [factorial:subfactorial::primorial:?] A079266 f(n) = [n#/e + 1/2] -- 0, 1, 2, 11, 77, 850, 11047, 187806, 3568317, 82071280, 2380067130, 73782081030,
*superprimorial: A079264 referring to product of first n primorials, f(n) = P(#n) -- 1, 2, 12, 360, 75600, 174636000, 5244319080000, 2677277333530800000
supersuperfactorial: [A. Berezin] f(n) = n$ = g(4, 2, n!) -- 1, 2, g(4, 2, 6) > g(2, 5, g(3, 3, 10)), g(4, 2, 12) > g(2, 5, g(3, 9, 10))
tree: [Robert E. Smith] referring to integer with g(2, 2, n) digits arrangable in rows of 2n + 1 digits like a Christmas tree -- 1000, 1001, ..., 9999, 100000000, 100000001, ...
Ulysses: [Ulysses by James Joyce, see A054382, [log(f(n))]] referring to integer like 369,693,100-digit g(2, 2, 9, 9) = g(2, g(2, 9, 9), 9) = g(2, 99, 9), f(n) = g(2, 2, n, n) -- 1, 16, 7625597484987, c. 1.3407807g(2, 154, 10), c. 1.9110g(2, 2185, 10), c. 2.6591g(2, 36036, 10), c. 3.7598g(2, 695975, 10), c. 6.0145g(2, 15151336, 10), c. 4.2812g(2, 369693100, 10), g(2, 10000000000, 10)