OFFSET
1,2
COMMENTS
An "exponential comma sequence" is the lexicographically earliest sequence of positive integers (with some chosen initial term) with the property that the sequence formed by the pairs of digits adjacent to the commas between the terms is the same as the sequence of successive logarithms between the terms.
If the decimal expansion of n is 1...0, its exponential comma sequence is trivially constant and therefore infinite so that a(n) = -1. Conjecture: these are the only infinite exponential comma sequences.
LINKS
Kevin Ryde, Table of n, a(n) for n = 1..10000
Kevin Ryde, C Code
EXAMPLE
For n = 2, the next term of its exponential comma sequence is 67108864 because log_2(67108864) = 26 and this is the smallest number where the exponential comma property holds.
MATHEMATICA
ExponentialCommaSequenceLength[n_] := Module[{seq = {n}, i = 1},
While[True,
Do[
If[(IntegerDigits@Power[Last@seq, Mod[Last@commaSeq, 10]*10 + j])[[1]] == j,
seq = seq~Join~{Power[Last@seq, Mod[Last@commaSeq, 10]*10 + j]};
Break[]; ]; ,
{j, 1, 9}
];
If[Length@seq != i + 1, Break[]; ];
If[seq[[1]] == seq[[2]], Return[-1]];
i++;
];
Length@seq
]
PROG
(C) /* See links. */
CROSSREFS
KEYWORD
base,sign,changed
AUTHOR
Nicholas M. R. Frieler, Aug 19 2024
STATUS
approved