The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077688 a(n) = sum of all cyclic permuted concatenations of the next n numbers. 1
1, 55, 1665, 269884, 6565656565, 1121212121211, 176767676767675, 26262626262626260, 3727272727272727269, 510101010101010101005, 67777777777777777777771, 8787878787878787878787870, 1116161616161616161616161605 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
For n not in A068092 (implying that all n numbers in the concatenation have the same length L), a(n) = ((n^2+1)*n)/2 * (10^(L*n)-1)/(10^L-1), where L = ceiling(log(n^2/2)/log(10)). - Max Alekseyev, Feb 11 2005
EXAMPLE
a(2) = 23 + 32, a(4) = 78910 + 89107 + 91078 + 10789 = 269884 = sum of concatenation of numbers in each group: (7,8,9,10), (8,9,10,7), (9,10,7,8), (10,7,8,9).
PROG
(PARI) { len10(n) = ceil(log(n+1)/log(10)) } { A077688(n) = local(m, w, s); m=0; for(k=1+(n*(n-1))/2, (n*(n+1))/2, m=m*10^len10(k)+k ); w=10^len10(m); s=0; for(k=1+(n*(n-1))/2, (n*(n+1))/2, m=(m*10^len10(k)+k)%w; s+=m ); return(s); } \ for n not in A068092 { a(n) = local(l); l=len10(n^2/2); return((n^2+1)*n*(10^(l*n)-1)/(10^l-1)/2) } \\ Max Alekseyev, Feb 11 2005
CROSSREFS
Sequence in context: A017718 A173113 A166844 * A188712 A049435 A327511
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Nov 16 2002
EXTENSIONS
More terms from Max Alekseyev, Feb 11 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 9 09:30 EDT 2024. Contains 373239 sequences. (Running on oeis4.)