cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A144122 (1, 2, 3, 2^2, 5, 2*3, 7, 2^3, 3^2, 2*5, 11, 2^2*3, 13, ...) becomes (0, 1, 4, 6^8, 9, 10*12, 14, 15^16, 18^20, 21*22, 24, 25^26*27, 28, ...).

This page as a plain text file.
%I A144122 #9 Oct 05 2015 03:01:50
%S A144122 0,1,4,1679616,9,120,14,6568408355712890625,
%T A144122 12748236216396078174437376,462,24,
%U A144122 59952043329758453182876110076904296875,28,960,1122,38587762477395204358312525169472792185842990875244140625,38
%N A144122 (1, 2, 3, 2^2, 5, 2*3, 7, 2^3, 3^2, 2*5, 11, 2^2*3, 13, ...) becomes (0, 1, 4, 6^8, 9, 10*12, 14, 15^16, 18^20, 21*22, 24, 25^26*27, 28, ...).
%e A144122 6^8 = 1679616 = a(4),
%e A144122 9 = a(5),
%e A144122 10*12 = 120 = a(6),
%e A144122 etc.
%p A144122 A141468 := proc(n) if n <=2 then n-1; else for a from procname(n-1)+1 do if not isprime(a) then return a; end if; end do: end if; end proc:
%p A144122 A144122 := proc(nmax) local a, ifs, n, p, c ; printf("0,1,") ; c := 3 ; for n from 3 to nmax do ifs := ifactors(n)[2] ; a := 1; for p in ifs do if op(2,p) > 1 then a := a*A141468(c)^A141468(c+1) ; c := c+2 ; else a := a*A141468(c) ; c := c+1 ; fi; od: printf("%d,",a) ; od: return ; end: A144122(20) ; # _R. J. Mathar_, Apr 28 2010
%Y A144122 Cf. A141468, A141186, A143677.
%K A144122 nonn
%O A144122 1,3
%A A144122 _Juri-Stepan Gerasimov_, Nov 17 2008
%E A144122 More terms from _R. J. Mathar_, Apr 28 2010