Yesterday I wrote, in part:

If not, has anyone tried summing (2/3)^j for every appropriate sequence in OEIS?

I did this this afternoon, for all sequences in OEIS, skipping negative, zero, oversized, and duplicate terms in each sequence. I was briefly excited to see that A077468 was equal to 1 for at least 17 places, which would be extremely unlikely to happen by chance. But it turns out that that entry is "Greedy powers of (2/3): sum_{n=1..inf} (2/3)^a(n) = 1. 25" At least I know my program works. ("Oversized" because (2/3)^j for j>100 is too small to make a difference to a sum close to 1 with 64-bit precision.) I wrote the program in C, using my DEC VT420 terminal, and ran it directly on my shell-account ISP, Panix. It took less than three seconds to run even though more than 50 other users were logged in. The program is just 28 lines long.